{"id":"https://openalex.org/W3115470548","doi":"https://doi.org/10.1145/3402926","title":"Deterministic APSP, Orthogonal Vectors, and More","display_name":"Deterministic APSP, Orthogonal Vectors, and More","publication_year":2020,"publication_date":"2020-12-31","ids":{"openalex":"https://openalex.org/W3115470548","doi":"https://doi.org/10.1145/3402926","mag":"3115470548"},"language":"en","primary_location":{"id":"doi:10.1145/3402926","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3402926","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3402926","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3402926","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032955418","display_name":"Timothy M. Chan","orcid":"https://orcid.org/0000-0002-8093-0675"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Timothy M. Chan","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL"],"raw_orcid":"https://orcid.org/0000-0002-8093-0675","affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ryan Williams","raw_affiliation_strings":["MIT, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032955418"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.4565,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86656431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"14"},"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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/satisfiability","display_name":"Satisfiability","score":0.7377145290374756},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.7027292847633362},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6721797585487366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6685073375701904},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6209936141967773},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6189929842948914},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47913333773612976},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4580354690551758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40532851219177246},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12037137150764465}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7377145290374756},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.7027292847633362},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6721797585487366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6685073375701904},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6209936141967773},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6189929842948914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47913333773612976},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4580354690551758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40532851219177246},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12037137150764465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3402926","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3402926","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3402926","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3402926","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3402926","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3402926","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4712714692","display_name":null,"funder_award_id":"CCF-1814026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6090670893","display_name":null,"funder_award_id":"CCF-1212372","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7207409443","display_name":"AF: Small: Fundamental Problems in Geometric Data Structures","funder_award_id":"1814026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3115470548.pdf","grobid_xml":"https://content.openalex.org/works/W3115470548.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W1430582609","https://openalex.org/W1495935433","https://openalex.org/W1544195453","https://openalex.org/W1953176910","https://openalex.org/W1969865855","https://openalex.org/W1979124844","https://openalex.org/W1996980357","https://openalex.org/W2009994177","https://openalex.org/W2019807548","https://openalex.org/W2021227709","https://openalex.org/W2028341270","https://openalex.org/W2036350017","https://openalex.org/W2049153008","https://openalex.org/W2058426370","https://openalex.org/W2060919812","https://openalex.org/W2062514359","https://openalex.org/W2064790310","https://openalex.org/W2070678975","https://openalex.org/W2072064573","https://openalex.org/W2074359677","https://openalex.org/W2084732238","https://openalex.org/W2102477571","https://openalex.org/W2104734478","https://openalex.org/W2114365471","https://openalex.org/W2116794057","https://openalex.org/W2137407595","https://openalex.org/W2140232587","https://openalex.org/W2158695970","https://openalex.org/W2163137752","https://openalex.org/W2172382511","https://openalex.org/W2206830592","https://openalex.org/W2242296381","https://openalex.org/W2281885423","https://openalex.org/W2401929940","https://openalex.org/W2568071471","https://openalex.org/W2611287588","https://openalex.org/W2612047169","https://openalex.org/W2623873233","https://openalex.org/W2625993870","https://openalex.org/W2724706363","https://openalex.org/W2752908210","https://openalex.org/W2912133662","https://openalex.org/W2964142086","https://openalex.org/W2996824547","https://openalex.org/W3022326557","https://openalex.org/W3099570205","https://openalex.org/W4205582340","https://openalex.org/W4241657494","https://openalex.org/W4253255388","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W4287691960","https://openalex.org/W2007715402","https://openalex.org/W2004524662","https://openalex.org/W2963181990","https://openalex.org/W2913663107","https://openalex.org/W2960354271","https://openalex.org/W2899261484"],"abstract_inverted_index":{"We":[0],"show":[1],"how":[2,24],"to":[3,25,75,102,146,153,160],"solve":[4],"all-pairs":[5],"shortest":[6],"paths":[7],"on":[8,111],"n":[9,13,20,33,41,45,112,117,119],"nodes":[10],"in":[11,36,43,115],"deterministic":[12,44,90],"3>":[14],"/2>":[15],"\u03a9":[16],"(":[17,107,122],"\u221a":[18],"log":[19,40],")":[21,50,124],"time,":[22,125],"and":[23,65,68,72,136,170],"count":[26,76,104],"the":[27,57,73,128,161],"pairs":[28],"of":[29,62,141,163],"orthogonal":[30],"vectors":[31,35],"among":[32],"0\u22121":[34],"d":[37],"=":[38],"c":[39,49],"dimensions":[42],"2\u22121/":[46],"O":[47,121],"(log":[48],"time.":[51],"These":[52],"running":[53,131],"times":[54,132],"essentially":[55],"match":[56],"best":[58,129],"known":[59,130],"randomized":[60,81],"algorithms":[61,91,162],"Williams":[63],"[46]":[64],"Abboud,":[66],"Williams,":[67],"Yu":[69],"[8],":[70],"respectively,":[71],"ability":[74],"was":[77],"open":[78,139],"even":[79],"for":[80,92,133],"algorithms.":[82],"By":[83],"reductions,":[84],"these":[85],"two":[86],"results":[87],"yield":[88],"faster":[89],"many":[93],"other":[94],"problems.":[95],"Our":[96],"techniques":[97],"can":[98],"also":[99],"be":[100],"used":[101],"deterministically":[103,154],"k":[105,108,123],"-satisfiability":[106],"-SAT)":[109],"assignments":[110],"variable":[113],"formulas":[114],"2":[116],"-":[118],"/":[120],"roughly":[126],"matching":[127],"detecting":[134],"satisfiability":[135],"resolving":[137],"an":[138,150],"problem":[140],"Santhanam":[142],"[24].":[143],"A":[144],"key":[145],"our":[147],"constructions":[148],"is":[149],"efficient":[151],"way":[152],"simulate":[155],"certain":[156],"probabilistic":[157],"polynomials":[158],"critical":[159],"prior":[164],"work,":[165],"carefully":[166],"applying":[167],"small-biased":[168],"sets":[169],"modulus-amplifying":[171],"polynomials.":[172]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}