{"id":"https://openalex.org/W2006346148","doi":"https://doi.org/10.1145/800061.808763","title":"Speedups of deterministic machines by synchronous parallel machines","display_name":"Speedups of deterministic machines by synchronous parallel machines","alternate_titles":[],"publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W2006346148","doi":"https://doi.org/10.1145/800061.808763","mag":"2006346148"},"language":"en","primary_location":{"id":"doi:10.1145/800061.808763","doi":"https://doi.org/10.1145/800061.808763","is_oa":false,"landing_page_url":"https://doi.org/10.1145/800061.808763","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2006346148"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031636382","display_name":"Patrick W. Dymond","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Patrick W. Dymond","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, Mail Code C-014, University of California at San Diego, La Jolla, California 92093, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, Mail Code C-014, University of California at San Diego, La Jolla, California 92093, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008676408","display_name":"Martin Tompa","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Martin Tompa","raw_affiliation_strings":["Department of Computer Science, FR-35, University of Washington, Seattle, Washington 98195 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, FR-35, University of Washington, Seattle, Washington 98195 USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1113,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.7115903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"336","last_page":"343"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9355000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9355000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.01209999993443489,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.009600000455975533,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/space-time-tradeoff","display_name":"space-time tradeoff","score":0.5070000290870667},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.39800000190734863},{"id":"https://openalex.org/keywords/time-complexity-classes","display_name":"time complexity classes","score":0.3790000081062317}],"concepts":[{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.9698611497879028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5992078185081482},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5820878744125366},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.5789303779602051},{"id":"https://openalex.org/C38264464","wikidata":"https://www.wikidata.org/wiki/Q1155722","display_name":"DSPACE","level":2,"score":0.5728574395179749},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5413686037063599},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42195209860801697},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.3116111755371094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27527162432670593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22080743312835693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20007187128067017},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.1037282943725586},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0714188814163208}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800061.808763","doi":"https://doi.org/10.1145/800061.808763","is_oa":false,"landing_page_url":"https://doi.org/10.1145/800061.808763","pdf_url":null,"source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W11770605","https://openalex.org/W1489807436","https://openalex.org/W1979469777","https://openalex.org/W1987856263","https://openalex.org/W2004618348","https://openalex.org/W2008840956","https://openalex.org/W2027501230","https://openalex.org/W2062934582","https://openalex.org/W2077054189","https://openalex.org/W2088141885","https://openalex.org/W2088300760","https://openalex.org/W2138170131","https://openalex.org/W2277064181"],"related_works":["https://openalex.org/W1976457015","https://openalex.org/W2117502507","https://openalex.org/W2167786223","https://openalex.org/W2287367534","https://openalex.org/W2078479724","https://openalex.org/W1488461309","https://openalex.org/W2081608347","https://openalex.org/W1593076843","https://openalex.org/W1984423678","https://openalex.org/W2052746194"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,16,53],"new":[4,42],"speedups":[5],"DTIME(T)":[6,11,24,34],"@@@@":[7,12,25,35,61],"ATIME(T/log":[8],"T)":[9],"and":[10,21,28,31,57],"PRAM-Time(@@@@T).":[13],"These":[14],"improve":[15],"results":[17],"of":[18,29,55],"Hopcroft,":[19],"Paul,":[20],"Valiant":[22,58],"that":[23,33,59],"DSPACE(T/log":[26],"T),":[27],"Paul":[30],"Reischuk":[32],"ATIME(T":[36],"log":[37,38],"T/log":[39],"T).":[40],"The":[41],"approach":[43],"unifies":[44],"not":[45],"only":[46],"these":[47],"two":[48],"previous":[49],"results,":[50],"but":[51],"also":[52],"result":[54],"Paterson":[56],"Size(T)":[60],"Depth(O(T/log":[62],"T)).":[63]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2006346148","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
