{"id":"https://openalex.org/W2065231486","doi":"https://doi.org/10.1016/0304-3975(90)90188-n","title":"Communication complexity of PRAMs","display_name":"Communication complexity of PRAMs","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2065231486","doi":"https://doi.org/10.1016/0304-3975(90)90188-n","mag":"2065231486"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(90)90188-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(90)90188-n","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5034238598","display_name":"Alok Aggarwal","orcid":"https://orcid.org/0000-0002-4394-4488"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alok Aggarwal","raw_affiliation_strings":["IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","institution_ids":[]},{"raw_affiliation_string":"IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034065279","display_name":"Ashok K. Chandra","orcid":"https://orcid.org/0000-0002-8818-171X"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashok K. Chandra","raw_affiliation_strings":["IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","institution_ids":[]},{"raw_affiliation_string":"IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041731995","display_name":"Marc Snir","orcid":"https://orcid.org/0000-0002-3504-2468"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marc Snir","raw_affiliation_strings":["IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA","institution_ids":[]},{"raw_affiliation_string":"IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034238598"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":7.9603,"has_fulltext":false,"cited_by_count":246,"citation_normalized_percentile":{"value":0.98125997,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"71","issue":"1","first_page":"3","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9990000128746033,"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/binary-logarithm","display_name":"Binary logarithm","score":0.6299033164978027},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6056445837020874},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5734918117523193},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5358805060386658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5298782587051392},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.47202959656715393},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46477654576301575},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4516718089580536},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4379948675632477},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43352049589157104},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4154221713542938},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40501248836517334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38680100440979004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36733657121658325},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3673115074634552}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6299033164978027},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6056445837020874},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5734918117523193},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5358805060386658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5298782587051392},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.47202959656715393},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46477654576301575},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4516718089580536},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4379948675632477},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43352049589157104},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4154221713542938},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40501248836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38680100440979004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36733657121658325},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3673115074634552},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(90)90188-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(90)90188-n","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1582106056","https://openalex.org/W1655990431","https://openalex.org/W1972501001","https://openalex.org/W1977041160","https://openalex.org/W1978583881","https://openalex.org/W1981334972","https://openalex.org/W1982855589","https://openalex.org/W1985004065","https://openalex.org/W1989582918","https://openalex.org/W2002501531","https://openalex.org/W2004924114","https://openalex.org/W2011692114","https://openalex.org/W2012383375","https://openalex.org/W2035038579","https://openalex.org/W2035484943","https://openalex.org/W2038454316","https://openalex.org/W2049875664","https://openalex.org/W2060972166","https://openalex.org/W2066129337","https://openalex.org/W2067002313","https://openalex.org/W2071931508","https://openalex.org/W2087323281","https://openalex.org/W2093303125","https://openalex.org/W2103658959","https://openalex.org/W2136963271","https://openalex.org/W2137239103","https://openalex.org/W2296545821","https://openalex.org/W4249486448","https://openalex.org/W6644496052","https://openalex.org/W6645429778","https://openalex.org/W6645875365","https://openalex.org/W6647419326","https://openalex.org/W6652671575","https://openalex.org/W6653370148","https://openalex.org/W6663361344","https://openalex.org/W6665902399","https://openalex.org/W6667001608","https://openalex.org/W6680380777","https://openalex.org/W6697234635","https://openalex.org/W7057659579"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2008470896","https://openalex.org/W4377371889","https://openalex.org/W2113623403","https://openalex.org/W2952190127","https://openalex.org/W4295288333","https://openalex.org/W2887154986","https://openalex.org/W4287692398","https://openalex.org/W3144947242","https://openalex.org/W3047118271"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}