{"id":"https://openalex.org/W4399374372","doi":"https://doi.org/10.1145/3662158.3662797","title":"Deterministic Expander Routing: Faster and More Versatile","display_name":"Deterministic Expander Routing: Faster and More Versatile","publication_year":2024,"publication_date":"2024-06-05","ids":{"openalex":"https://openalex.org/W4399374372","doi":"https://doi.org/10.1145/3662158.3662797"},"language":"en","primary_location":{"id":"doi:10.1145/3662158.3662797","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3662158.3662797","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3662158.3662797","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061847213","display_name":"Yi\u2010Jun Chang","orcid":"https://orcid.org/0000-0002-0109-2432"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Yi-Jun Chang","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-0109-2432","affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086319053","display_name":"Shang-En Huang","orcid":"https://orcid.org/0000-0002-9799-0981"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shang-En Huang","raw_affiliation_strings":["Boston College, Chestnut Hill, USA"],"raw_orcid":"https://orcid.org/0000-0002-9799-0981","affiliations":[{"raw_affiliation_string":"Boston College, Chestnut Hill, USA","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["Boston College, Chestnut Hill, United States of America"],"raw_orcid":"https://orcid.org/0009-0002-7970-9604","affiliations":[{"raw_affiliation_string":"Boston College, Chestnut Hill, United States of America","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9614,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76993529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"194","last_page":"204"},"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.9998999834060669,"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.9998999834060669,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/computer-science","display_name":"Computer science","score":0.6259307861328125},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5570712685585022},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.5090956091880798},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.48464447259902954},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.27842020988464355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13580474257469177}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6259307861328125},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5570712685585022},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.5090956091880798},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.48464447259902954},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.27842020988464355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13580474257469177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3662158.3662797","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3662158.3662797","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3662158.3662797","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3662158.3662797","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1984361668","https://openalex.org/W2015819397","https://openalex.org/W2026798971","https://openalex.org/W2064306958","https://openalex.org/W2083323175","https://openalex.org/W2084427019","https://openalex.org/W2552279664","https://openalex.org/W2618303782","https://openalex.org/W2737872496","https://openalex.org/W2809286672","https://openalex.org/W2963207398","https://openalex.org/W2965127607","https://openalex.org/W3008203175","https://openalex.org/W3046349810","https://openalex.org/W3114868980","https://openalex.org/W3127810600","https://openalex.org/W3128057791","https://openalex.org/W3160071378","https://openalex.org/W3170201847","https://openalex.org/W3175371195","https://openalex.org/W3203699756","https://openalex.org/W4252842032","https://openalex.org/W4281710856","https://openalex.org/W4286210491","https://openalex.org/W4376639528","https://openalex.org/W4396813748","https://openalex.org/W6891520935"],"related_works":["https://openalex.org/W2075067217","https://openalex.org/W4254709952","https://openalex.org/W2026034687","https://openalex.org/W1687060458","https://openalex.org/W1976154696","https://openalex.org/W2353466952","https://openalex.org/W2609535666","https://openalex.org/W4240977383","https://openalex.org/W4256116802","https://openalex.org/W4235738893"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,15,21,31,34,54,60,63,87,95,106,120],"expander":[3,110,131],"routing":[4,88,111],"problem":[5,48],"formulated":[6],"by":[7,69],"Ghaffari,":[8],"Kuhn,":[9],"and":[10,33,73,103,133],"Su":[11],"(PODC":[12],"2017),":[13],"where":[14,57],"goal":[16],"is":[17,30,59,78],"to":[18,23,80,114],"route":[19],"all":[20],"tokens":[22],"their":[24],"destinations":[25],"given":[26],"that":[27,45,86],"each":[28],"vertex":[29],"source":[32],"destination":[35],"of":[36,62,97,105,109],"at":[37,94],"most":[38],"deg(\u03c5)":[39],"tokens.":[40],"They":[41],"developed":[42],"randomized":[43],"algorithms":[44,118,129,135],"solve":[46],"this":[47],"in":[49,53,119,130,139],"poly":[50],"[EQUATION]":[51],"rounds":[52],"CONGEST":[55,121],"model,":[56,122],"\u03d5":[58],"conductance":[61],"graph.":[64],"In":[65],"addition,":[66],"as":[67,124],"noted":[68],"Chang,":[70],"Pettie,":[71],"Saranurak,":[72],"Zhang":[74],"(JACM":[75],"2021),":[76],"it":[77],"possible":[79],"obtain":[81],"a":[82],"preprocessing/query":[83],"tradeoff":[84,108],"so":[85],"queries":[89],"can":[90],"be":[91],"answered":[92],"faster":[93],"cost":[96],"more":[98],"preprocessing":[99],"time.":[100],"The":[101],"efficiency":[102],"flexibility":[104],"processing/query":[107],"have":[112],"led":[113],"many":[115],"other":[116],"distributed":[117],"such":[123],"subpolynomial-round":[125],"minimum":[126],"spanning":[127],"tree":[128],"graphs":[132],"near-optimal":[134],"for":[136],"k-clique":[137],"enumeration":[138],"general":[140],"graphs.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}