{"id":"https://openalex.org/W2898122202","doi":"https://doi.org/10.1109/ita.2018.8503262","title":"Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds","display_name":"Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds","publication_year":2018,"publication_date":"2018-02-01","ids":{"openalex":"https://openalex.org/W2898122202","doi":"https://doi.org/10.1109/ita.2018.8503262","mag":"2898122202"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2018.8503262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2018.8503262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-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/A5013551063","display_name":"Kasper Green Larsen","orcid":"https://orcid.org/0000-0001-8841-5929"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kasper Green Larsen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055582428","display_name":"Omri Weinstein","orcid":"https://orcid.org/0000-0002-9357-2299"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Omri Weinstein","raw_affiliation_strings":["Department of Computer Science, Columbia University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055157975","display_name":"Huacheng Yu","orcid":"https://orcid.org/0000-0003-1450-1896"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huacheng Yu","raw_affiliation_strings":["Department of Computer Science, Stanford University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013551063"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73537068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11269","display_name":"Algorithms and Data Compression","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7013230919837952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6457292437553406},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.47592785954475403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45182982087135315},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.43295031785964966},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37310415506362915},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28084301948547363}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7013230919837952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6457292437553406},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.47592785954475403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45182982087135315},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.43295031785964966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37310415506362915},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28084301948547363},{"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.1109/ita.2018.8503262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2018.8503262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1889224378","https://openalex.org/W1963524245","https://openalex.org/W1988508518","https://openalex.org/W1989664320","https://openalex.org/W1993022201","https://openalex.org/W1996861774","https://openalex.org/W1999052090","https://openalex.org/W2029948740","https://openalex.org/W2065240689","https://openalex.org/W2080995342","https://openalex.org/W2089620427","https://openalex.org/W2090208705","https://openalex.org/W2091556334","https://openalex.org/W2101403145","https://openalex.org/W2127259150","https://openalex.org/W2144518319","https://openalex.org/W2170156299","https://openalex.org/W2198278046","https://openalex.org/W2329095262","https://openalex.org/W2571362173","https://openalex.org/W2963385941","https://openalex.org/W2963834565","https://openalex.org/W4205550388","https://openalex.org/W4238759872","https://openalex.org/W4249974845","https://openalex.org/W6684524630","https://openalex.org/W6764074527"],"related_works":["https://openalex.org/W2075126249","https://openalex.org/W2105128170","https://openalex.org/W2918709778","https://openalex.org/W1991822629","https://openalex.org/W3141532631","https://openalex.org/W52722086","https://openalex.org/W2495550620","https://openalex.org/W2995277268","https://openalex.org/W2558644562","https://openalex.org/W2011175857"],"abstract_inverted_index":{"This":[0,108,192],"paper":[1],"proves":[2],"the":[3,9,53,68,102,112,121,129,159,216],"first":[4,113],"super-logarithmic":[5],"lower":[6,27,39,50,86,118,144],"bounds":[7,40,145],"on":[8,52,67,215],"cell":[10,37],"probe":[11,38],"complexity":[12],"of":[13,56,60,71,96,128,149,162,175,205,220],"dynamic":[14,36,72,150,178],"boolean":[15,61,147],"(a.k.a.":[16],"decision)":[17],"data":[18,25,62,132,179],"structure":[19,26,63,133],"problems,":[20,64],"a":[21,31,46,57,172,195],"long-standing":[22],"milestone":[23],"in":[24,101,135],"bounds.":[28],"We":[29,141],"introduce":[30],"new":[32,173,212],"method":[33,219],"for":[34,88,120,146,158],"proving":[35],"and":[41,138,153,157,165,208],"use":[42],"it":[43],"to":[44,198],"prove":[45],"<tex":[47,76,82,114],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[48,77,83,115],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\tilde{\\Omega}(\\text{lg}^{1.5}n)$</tex>":[49],"bound":[51,87,119],"operational":[54],"time":[55,70],"wide":[58],"range":[59,73,124,163,166],"most":[65,130],"notably,":[66],"query":[69],"counting":[74,125],"over":[75,189],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{F}_{2}$</tex>":[78],"([Pat07]).":[79],"Proving":[80],"an":[81,210],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\omega(\\text{lg}\\":[84,116],"n)$</tex>":[85,117],"this":[89],"problem":[90],"was":[91],"explicitly":[92],"posed":[93],"as":[94],"one":[95,127],"five":[97],"important":[98],"open":[99],"problems":[100,134,161],"late":[103],"Mihai":[104],"P\u0103tra\u015fcu's":[105],"obituary":[106],"[Tho13].":[107],"result":[109],"also":[110],"implies":[111],"classical":[122],"2D":[123,154],"problem,":[126],"fundamental":[131],"computational":[136],"geometry":[137],"spatial":[139],"databases.":[140],"derive":[142],"similar":[143],"versions":[148],"polynomial":[151],"evaluation":[152],"rectangle":[155],"stabbing,":[156],"(non-boolean)":[160],"selection":[164],"median.":[167],"Our":[168],"technical":[169],"centerpiece":[170],"is":[171],"way":[174],"\u201cweakly\u201d":[176],"simulating":[177],"structures":[180],"using":[181],"efficient":[182],"one-way":[183],"communication":[184],"protocols":[185],"with":[186],"small":[187],"advantage":[188],"random":[190],"guessing.":[191],"simulation":[193],"involves":[194],"surprising":[196],"excursion":[197],"low-degree":[199],"(Chebychev)":[200],"polynomials":[201],"which":[202],"may":[203],"be":[204],"independent":[206],"interest,":[207],"offers":[209],"entirely":[211],"algorithmic":[213],"angle":[214],"\u201ccell":[217],"sampling\u201d":[218],"Panigrahy":[221],"et":[222],"al.":[223],"[PTW10].":[224]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}