{"id":"https://openalex.org/W7128606847","doi":"https://doi.org/10.1109/focs63196.2025.00078","title":"Lower Bounds for Non-adaptive Local Computation Algorithms","display_name":"Lower Bounds for Non-adaptive Local Computation Algorithms","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128606847","doi":"https://doi.org/10.1109/focs63196.2025.00078"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00078","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5049819184","display_name":"Amir Azarmehr","orcid":"https://orcid.org/0009-0005-6451-3985"},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Amir Azarmehr","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125649300","display_name":"Soheil Behnezhad","orcid":null},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104278897","display_name":"Alma Ghafari","orcid":null},"institutions":[{"id":"https://openalex.org/I87182695","display_name":"Universidad del Noreste","ror":"https://ror.org/02ahky613","country_code":"MX","type":"education","lineage":["https://openalex.org/I87182695"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Alma Ghafari","raw_affiliation_strings":["Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I87182695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519420","display_name":"Madhu Sudan","orcid":null},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Harvard Univeristy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard Univeristy","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.69802318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1488","last_page":"1511"},"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.8465999960899353,"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.8465999960899353,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.07900000363588333,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.014299999922513962,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7879999876022339},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7131999731063843},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.628000020980835},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6104000210762024},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5113000273704529},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4909000098705292},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4611000120639801},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4237000048160553}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7879999876022339},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7131999731063843},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.628000020980835},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6104000210762024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5133000016212463},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5113000273704529},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47540000081062317},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4611000120639801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.459199994802475},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4237000048160553},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.365200012922287},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32100000977516174},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3068000078201294},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.29429998993873596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28780001401901245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2721000015735626},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00078","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,263],"study":[1,99],"non-adaptive":[2,20,29,80,101,180,196],"Local":[3],"Computation":[4,126],"Algorithms":[5],"(LCA).":[6],"A":[7],"reduction":[8,215],"of":[9,34,57,100,148,186,216,228,255,279,305,318,327,336],"Parnas":[10,217],"and":[11,38,197,200,218,234,258,282],"Ron":[12],"(TCS\u201907)":[13],"turns":[14],"any":[15,179,302,306],"distributed":[16,24,235,286],"algorithm":[17,210],"into":[18],"a":[19,73,84,107,144,155,183,268,309,320],"LCA.":[21],"Plugging":[22],"known":[23],"algorithms,":[25],"this":[26,62,161],"leads":[27],"to":[28,68,134,204],"LCAs":[30,102],"for":[31,114,141,163,178],"constant":[32,184],"approximations":[33],"maximum":[35,55],"matching":[36,321],"(MM)":[37],"minimum":[39],"vertex":[40],"cover":[41],"(MVC)":[42],"with":[43],"complexity":[44],"$\\Delta^{O(\\log":[45],"\\Delta":[46,170,313,339],"/":[47,171,314,340],"\\log":[48,49,172,173,315,316,341,342],"\\Delta)}$,":[50],"where":[51],"$\\Delta$":[52],"is":[53,71,154,191],"the":[54,58,98,111,115,123,149,192,207,209,213,249,277,292,297,325],"degree":[56],"graph.":[59],"Allowing":[60],"adaptivity,":[61],"bound":[63,113,157],"can":[64],"be":[65],"significantly":[66],"improved":[67],"$\\operatorname{poly}(\\Delta)$,":[69],"but":[70],"such":[72,242],"gap":[74],"necessary":[75],"or":[76,188],"are":[77,176,344],"there":[78],"better":[79],"LCAs?":[81],"Adaptivity":[82],"as":[83,243],"resource":[85],"has":[86,296,308],"been":[87],"studied":[88],"extensively":[89],"across":[90],"various":[91],"areas.":[92],"Beyond":[93],"this,":[94],"we":[95,166,239],"further":[96],"motivate":[97],"by":[103,212],"showing":[104],"that":[105,158,168,291,301,331],"even":[106],"modest":[108],"improvement":[109],"over":[110,245],"Parnas-Ron":[112],"MVC":[116],"problem":[117,147],"would":[118,132],"have":[119],"major":[120,145],"implications":[121],"in":[122,206],"Massively":[124],"Parallel":[125],"(MPC)":[127],"setting.":[128],"In":[129,323],"particular,":[130],"it":[131],"lead":[133],"faster":[135],"truly":[136],"sublinear":[137,230,251],"space":[138],"MPC":[139],"algorithms":[140],"approximate":[142],"MM,":[143],"open":[146],"area.":[150],"Our":[151,220,288],"main":[152],"result":[153],"lower":[156,232,236,253],"rules":[159],"out":[160],"avenue":[162],"progress.":[164],"Specifically,":[165],"prove":[167],"$\\Delta^{\\Omega(\\log":[169],"\\Delta)}$":[174],"queries":[175],"needed":[177],"LCA":[181],"computing":[182],"approximation":[185],"MM":[187],"MVC.":[189],"This":[190],"first":[193],"separation":[194],"between":[195],"adaptive":[198],"LCAs,":[199],"already":[201],"matches":[202],"(up":[203],"constants":[205],"exponent)":[208],"obtained":[211],"black-box":[214],"Ron.":[219],"proof":[221,289],"blends":[222],"techniques":[223,241,266],"from":[224,248,285],"two":[225],"separate":[226],"lines":[227],"work:":[229],"time":[231,252],"bounds":[233,254],"bounds.":[237],"Particularly,":[238],"adopt":[240],"couplings":[244],"acyclic":[246],"subgraphs":[247],"recent":[250],"Behnezhad,":[256],"Roghani,":[257],"Rubinstein":[259],"(STOC\u201923,":[260],"FOCS\u201923,":[261],"STOC\u201924).":[262],"apply":[264],"these":[265],"on":[267],"very":[269],"different":[270],"instance,":[271],"particularly":[272],"(a":[273],"modified":[274],"version":[275],"of)":[276],"construction":[278],"Kuhn,":[280],"Moscibroda":[281],"Wattenhoffer":[283],"(JACM\u201916)":[284],"computing.":[287],"reveals":[290],"(modified)":[293],"KMW":[294,328],"instance":[295],"rather":[298],"surprising":[299],"property":[300],"random":[303],"walk":[304],"length":[307],"tiny":[310],"chance":[311],"$\\left(\\Delta^{-\\Omega(\\log":[312],"\\Delta)}\\right)$":[317],"identifying":[319],"edge.":[322],"contrast,":[324],"work":[326],"only":[329],"proves":[330],"short":[332],"walks":[333,335],"(i.e.,":[334],"depth":[337],"$O(\\log":[338],"\\Delta)$)":[343],"not":[345],"useful.":[346]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-12T00:00:00"}