{"id":"https://openalex.org/W1971262016","doi":"https://doi.org/10.1007/bf01762110","title":"Communication-efficient parallel algorithms for distributed random-access machines","display_name":"Communication-efficient parallel algorithms for distributed random-access machines","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W1971262016","doi":"https://doi.org/10.1007/bf01762110","mag":"1971262016"},"language":"en","primary_location":{"id":"doi:10.1007/bf01762110","doi":"https://doi.org/10.1007/bf01762110","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762110","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"volume":null,"type":"article","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/A5027618658","display_name":"Charles E. Leiserson","orcid":"https://orcid.org/0000-0001-6386-5552","observed_orcids":["https://orcid.org/0000-0001-6386-5552"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles E. Leiserson","raw_affiliation_strings":["Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA","Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, USA 02139#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, USA 02139#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046808993","display_name":"Bruce MacDowell Maggs","orcid":"https://orcid.org/0000-0002-5692-7062","observed_orcids":["https://orcid.org/0000-0002-5692-7062"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce M. Maggs","raw_affiliation_strings":["Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA","Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, USA 02139#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, USA 02139#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":3.7443,"has_fulltext":false,"cited_by_count":71,"citation_normalized_percentile":{"value":0.93014895,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"3","issue":"1-4","first_page":"53","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7348999977111816,"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.7348999977111816,"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.1964000016450882,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.009800000116229057,"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/conservative-algorithms","display_name":"conservative algorithms","score":0.859000027179718},{"id":"https://openalex.org/keywords/network-congestion","display_name":"network congestion","score":0.6499999761581421},{"id":"https://openalex.org/keywords/tree-based-algorithms","display_name":"tree-based algorithms","score":0.4050000011920929},{"id":"https://openalex.org/keywords/expression-trees","display_name":"expression trees","score":0.8169999718666077},{"id":"https://openalex.org/keywords/biconnected-components","display_name":"biconnected components","score":0.9980000257492065},{"id":"https://openalex.org/keywords/eulerian-cycles","display_name":"Eulerian cycles","score":0.8009999990463257},{"id":"https://openalex.org/keywords/tree-contraction","display_name":"tree contraction","score":0.9110000133514404},{"id":"https://openalex.org/keywords/parallel-computing-models","display_name":"parallel computing models","score":0.3630000054836273}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8107718229293823},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5751117467880249},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5335832834243774},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4637407064437866},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4443434178829193},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41290947794914246},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.4119175970554352}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01762110","doi":"https://doi.org/10.1007/bf01762110","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762110","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.3249","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.3249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/afs/cs.cmu.edu/project/phrensy/pub/papers/compressed/LeisersonM88.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1509443229","https://openalex.org/W1513400187","https://openalex.org/W1525859652","https://openalex.org/W1585714998","https://openalex.org/W1766349993","https://openalex.org/W1967810725","https://openalex.org/W1983982468","https://openalex.org/W2001274023","https://openalex.org/W2004350101","https://openalex.org/W2007470648","https://openalex.org/W2013444956","https://openalex.org/W2022143201","https://openalex.org/W2029294176","https://openalex.org/W2038643780","https://openalex.org/W2042587503","https://openalex.org/W2042876290","https://openalex.org/W2049875664","https://openalex.org/W2074456731","https://openalex.org/W2075488055","https://openalex.org/W2091104536","https://openalex.org/W2091128593","https://openalex.org/W2107997203","https://openalex.org/W2116497098","https://openalex.org/W2123806189","https://openalex.org/W2130566259","https://openalex.org/W2143462372","https://openalex.org/W2168543008","https://openalex.org/W2171608071","https://openalex.org/W2752853835","https://openalex.org/W3010672433","https://openalex.org/W3173410517","https://openalex.org/W4240067387"],"related_works":["https://openalex.org/W1525859652","https://openalex.org/W28243696","https://openalex.org/W1560481450","https://openalex.org/W2155209532","https://openalex.org/W1534345552","https://openalex.org/W206295951","https://openalex.org/W2155086352","https://openalex.org/W7097287356","https://openalex.org/W78403084","https://openalex.org/W4247317172"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}