{"id":"https://openalex.org/W1967575173","doi":"https://doi.org/10.1137/0213027","title":"Simulation of Parallel Random Access Machines by Circuits","display_name":"Simulation of Parallel Random Access Machines by Circuits","publication_year":1984,"publication_date":"1984-05-01","ids":{"openalex":"https://openalex.org/W1967575173","doi":"https://doi.org/10.1137/0213027","mag":"1967575173"},"language":"en","primary_location":{"id":"doi:10.1137/0213027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213027","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/A5111558966","display_name":"Larry Stockmeyer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Larry Stockmeyer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111558966"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.7598,"has_fulltext":false,"cited_by_count":188,"citation_normalized_percentile":{"value":0.99207317,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"2","first_page":"409","last_page":"422"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/transitive-closure","display_name":"Transitive closure","score":0.6772280335426331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5784690976142883},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5068510174751282},{"id":"https://openalex.org/keywords/alternation","display_name":"Alternation (linguistics)","score":0.4964368939399719},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4821021854877472},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46868613362312317},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45231834053993225},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44961613416671753},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4447338581085205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3596891760826111},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2480500340461731}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6772280335426331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5784690976142883},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5068510174751282},{"id":"https://openalex.org/C26826806","wikidata":"https://www.wikidata.org/wiki/Q438358","display_name":"Alternation (linguistics)","level":2,"score":0.4964368939399719},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4821021854877472},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46868613362312317},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45231834053993225},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44961613416671753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4447338581085205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3596891760826111},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2480500340461731},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213027","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":[{"score":0.8899999856948853,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1963920725","https://openalex.org/W1965022641","https://openalex.org/W1985592215","https://openalex.org/W1986804393","https://openalex.org/W2004618348","https://openalex.org/W2045717693","https://openalex.org/W2049337025","https://openalex.org/W2087489294","https://openalex.org/W2088141885","https://openalex.org/W2088300760","https://openalex.org/W2089828587","https://openalex.org/W3143083401","https://openalex.org/W4206658214","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W2359423766","https://openalex.org/W1600485007","https://openalex.org/W2364216866","https://openalex.org/W2362009423","https://openalex.org/W2614633957","https://openalex.org/W2391894074","https://openalex.org/W2070131906","https://openalex.org/W1546475804","https://openalex.org/W2158905189","https://openalex.org/W4319874546"],"abstract_inverted_index":{"A":[0],"relationship":[1],"is":[2,83,93,139],"established":[3],"between":[4],"(i)":[5],"parallel":[6,147],"random-access":[7],"machines":[8],"that":[9,40,112,183],"allow":[10],"many":[11],"processors":[12,62],"to":[13,68,73,84,94,150,176,192],"concurrently":[14],"read":[15],"from":[16],"or":[17,26],"write":[18],"into":[19,28],"a":[20,86,96,100,129,133,155,159,172],"common":[21],"memory":[22,31],"including":[23],"simultaneous":[24],"reading":[25],"writing":[27],"the":[29,51,80,90,110,140,146,169],"same":[30],"location":[32],"(CROW":[33],"PRAM),":[34],"and":[35,44,55,59,75,89,106,119,167,180,186,194],"(ii)":[36],"combinational":[37],"logic":[38],"circuits":[39],"contain":[41],"AND's,":[42],"OR's":[43],"NOT's,":[45],"with":[46,132,158],"no":[47],"bound":[48,144],"placed":[49],"on":[50,145],"fan-in":[52],"of":[53,61,103,136,162,171],"AND-gates":[54],"OR-gates.":[56],"Parallel":[57],"time":[58,127,148,185],"number":[60,135,161],"for":[63,77,189,197],"CROW":[64,130,156],"PRAM's":[65],"are":[66],"shown":[67],"correspond":[69],"respectively":[70],"(and":[71],"simultaneously)":[72],"depth":[74],"size":[76],"circuits,":[78],"where":[79],"time-depth":[81],"correspondence":[82,92],"within":[85,95],"constant":[87,126],"factor":[88],"processors-size":[91],"polynomial.":[97],"By":[98],"applying":[99],"recent":[101],"result":[102],"Furst,":[104],"Saxe":[105],"Sipser,":[107],"we":[108],"obtain":[109],"corollary":[111],"parity,":[113],"integer":[114,120],"multiplication,":[115],"graph":[116],"transitive":[117],"closure":[118],"sorting":[121],"cannot":[122],"be":[123],"computed":[124],"in":[125],"by":[128,154],"PRAM":[131,157],"polynomial":[134,160],"processors.":[137,163],"This":[138],"first":[141],"nonconstant":[142],"lower":[143],"required":[149],"solve":[151],"these":[152],"problems":[153],"We":[164],"also":[165],"state":[166],"outline":[168],"proof":[170],"similar":[173],"result,":[174],"due":[175],"W.":[177],"L.":[178],"Ruzzo":[179],"M.":[181],"Tompa,":[182],"relates":[184],"processor":[187],"bounds":[188,196],"CRCW":[190],"PRAM'S":[191],"alternation":[193],"space":[195],"alternating":[198],"Turing":[199],"machines.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}