{"id":"https://openalex.org/W2070570981","doi":"https://doi.org/10.1137/0215006","title":"Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes","display_name":"Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes","publication_year":1986,"publication_date":"1986-02-01","ids":{"openalex":"https://openalex.org/W2070570981","doi":"https://doi.org/10.1137/0215006","mag":"2070570981"},"language":"en","primary_location":{"id":"doi:10.1137/0215006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215006","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen Cook","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011820318","display_name":"Cynthia Dwork","orcid":"https://orcid.org/0000-0001-7177-3738"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cynthia Dwork","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089868014","display_name":"R\u00fcdiger Reischuk","orcid":"https://orcid.org/0000-0003-2031-3664"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R\u00fcdiger Reischuk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.4519,"has_fulltext":false,"cited_by_count":341,"citation_normalized_percentile":{"value":0.99067471,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"15","issue":"1","first_page":"87","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958999752998352,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7047069668769836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7031385898590088},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6175820231437683},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6154345870018005},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.5701473951339722},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5481982827186584},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5281510353088379},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.51322340965271},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4920148551464081},{"id":"https://openalex.org/keywords/access-time","display_name":"Access time","score":0.44809722900390625},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44349849224090576},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4300999045372009},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4210802912712097},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37404507398605347},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3676570951938629},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3319406509399414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27929356694221497}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7047069668769836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7031385898590088},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6175820231437683},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6154345870018005},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.5701473951339722},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5481982827186584},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5281510353088379},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.51322340965271},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4920148551464081},{"id":"https://openalex.org/C194080101","wikidata":"https://www.wikidata.org/wiki/Q46306","display_name":"Access time","level":2,"score":0.44809722900390625},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44349849224090576},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4300999045372009},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4210802912712097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37404507398605347},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3676570951938629},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3319406509399414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27929356694221497},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215006","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2004618348","https://openalex.org/W2069489095","https://openalex.org/W2087489294"],"related_works":["https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W1581210843","https://openalex.org/W2018076478","https://openalex.org/W1982530285","https://openalex.org/W1529390395","https://openalex.org/W2611723985","https://openalex.org/W1838063489","https://openalex.org/W2515993118","https://openalex.org/W1830048115"],"abstract_inverted_index":{"One":[0],"of":[1,13,62,93,104,138],"the":[2,37,42,76,90,114],"frequently":[3],"used":[4],"models":[5],"for":[6,109],"a":[7,14,28,72,99,135],"synchronous":[8],"parallel":[9,15],"computer":[10],"is":[11,48,71],"that":[12,52],"random":[16,30],"access":[17,31],"machine,":[18],"where":[19],"each":[20],"processor":[21],"can":[22],"read":[23,36],"from":[24],"and":[25,64,88],"write":[26],"into":[27],"common":[29],"memory.":[32],"Different":[33],"processors":[34],"may":[35],"same":[38,43],"memory":[39],"location":[40],"at":[41],"time,":[44],"but":[45],"simultaneous":[46,122],"writing":[47],"disallowed.":[49],"We":[50,96],"show":[51],"even":[53],"if":[54],"we":[55],"allow":[56],"nonuniform":[57],"algorithms,":[58],"an":[59],"arbitrary":[60,65],"number":[61,137],"processors,":[63],"instruction":[66],"sets,":[67],"$\\Omega":[68],"(\\log":[69],"n)$":[70],"lower":[73],"bound":[74,103],"on":[75],"time":[77,101],"required":[78],"to":[79,130],"compute":[80,131],"various":[81],"simple":[82,128],"functions,":[83,111],"including":[84],"sorting":[85],"n":[86,94],"keys":[87],"finding":[89],"logical":[91],"\u201cor\u201d":[92],"bits.":[95],"also":[97],"prove":[98],"surprising":[100],"upper":[102],"$.72\\log":[105],"_2":[106,119],"n$":[107,120],"steps":[108],"these":[110,132],"which":[112],"beats":[113],"obvious":[115],"algorithms":[116,129],"requiring":[117],"$\\log":[118],"steps.If":[121],"writes":[123],"are":[124,127],"allowed,":[125],"there":[126],"functions":[133],"in":[134],"constant":[136],"steps.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}