{"id":"https://openalex.org/W2107997203","doi":"https://doi.org/10.1137/0211027","title":"A Scheme for Fast Parallel Communication","display_name":"A Scheme for Fast Parallel Communication","publication_year":1982,"publication_date":"1982-05-01","ids":{"openalex":"https://openalex.org/W2107997203","doi":"https://doi.org/10.1137/0211027","mag":"2107997203"},"language":"en","primary_location":{"id":"doi:10.1137/0211027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211027","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/A5015531084","display_name":"Leslie G. Valiant","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"L. G. Valiant","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015531084"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.5681,"has_fulltext":false,"cited_by_count":649,"citation_normalized_percentile":{"value":0.97368958,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"11","issue":"2","first_page":"350","last_page":"361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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.9980999827384949,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.715613603591919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.652766227722168},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6488944888114929},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5546264052391052},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5373795032501221},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5285263061523438},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5275440216064453},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5273664593696594},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.488269567489624},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45769721269607544},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4446370601654053},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.42157021164894104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41196703910827637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3932623863220215},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38913363218307495},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.36615514755249023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32079389691352844}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.715613603591919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.652766227722168},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6488944888114929},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5546264052391052},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5373795032501221},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5285263061523438},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5275440216064453},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5273664593696594},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.488269567489624},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45769721269607544},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4446370601654053},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.42157021164894104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41196703910827637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3932623863220215},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38913363218307495},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.36615514755249023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32079389691352844},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0211027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211027","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":[{"display_name":"Peace, Justice and strong institutions","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1964053266","https://openalex.org/W1988294273","https://openalex.org/W1988683687","https://openalex.org/W2004759812","https://openalex.org/W2011849452","https://openalex.org/W2033228515","https://openalex.org/W2042587503","https://openalex.org/W2061496873","https://openalex.org/W2089828587","https://openalex.org/W2134316164","https://openalex.org/W2141389982"],"related_works":["https://openalex.org/W1937416524","https://openalex.org/W2105195194","https://openalex.org/W1560383649","https://openalex.org/W2001791680","https://openalex.org/W1604225953","https://openalex.org/W2067886059","https://openalex.org/W2127965136","https://openalex.org/W2140106510","https://openalex.org/W2009411567","https://openalex.org/W2122010203"],"abstract_inverted_index":{"Consider":[0],"$N":[1],"=":[2],"2^n":[3],"$":[4],"nodes":[5,19,27,90],"connected":[6],"by":[7],"wires":[8],"to":[9,25,45],"make":[10],"an":[11],"n-dimensional":[12],"binary":[13],"cube.":[14,30],"Suppose":[15],"that":[16,33,40],"initially":[17],"the":[18,29,53,89,96,119],"contain":[20],"one":[21,58],"packet":[22,44,75],"each":[23],"addressed":[24],"distinct":[26],"of":[28,82,121],"We":[31],"show":[32],"there":[34],"is":[35],"a":[36,105],"distributed":[37],"randomized":[38],"algorithm":[39,94],"can":[41],"route":[42],"every":[43],"its":[46],"destination":[47],"without":[48],"two":[49],"packets":[50],"passing":[51],"down":[52],"same":[54],"wire":[55],"at":[56],"any":[57],"time,":[59],"and":[60,114],"finishes":[61],"within":[62],"time":[63,113],"$O(\\log":[64,79,111],"N)$":[65,80,112],"with":[66,77],"overwhelming":[67],"probability":[68],"for":[69,100],"all":[70],"such":[71],"routing":[72],"requests.":[73],"Each":[74],"carries":[76],"it":[78],"bits":[81],"bookkeeping":[83],"information.":[84],"No":[85],"other":[86],"communication":[87],"among":[88],"takes":[91],"place.":[92],"The":[93],"offers":[95],"only":[97],"scheme":[98],"known":[99],"realizing":[101],"arbitrary":[102],"permutations":[103],"in":[104,110,118],"sparse":[106],"N":[107],"node":[108],"network":[109],"has":[115],"evident":[116],"applications":[117],"design":[120],"general":[122],"purpose":[123],"parallel":[124],"computers.":[125]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":28},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":23},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}