{"id":"https://openalex.org/W1999560384","doi":"https://doi.org/10.1145/1536414.1536480","title":"Bit-probe lower bounds for succinct data structures","display_name":"Bit-probe lower bounds for succinct data structures","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W1999560384","doi":"https://doi.org/10.1145/1536414.1536480","mag":"1999560384"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536480","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","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/A5072846764","display_name":"Emanuele Viola","orcid":"https://orcid.org/0000-0001-6091-1824"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Emanuele Viola","raw_affiliation_strings":["Northeastern University, Boston, USA","[Northeastern University,Boston,USA]"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"[Northeastern University,Boston,USA]","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072846764"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":4.0546,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.93705032,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"475","last_page":"482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9961000084877014,"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/combinatorics","display_name":"Combinatorics","score":0.7094454765319824},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6892178058624268},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6017819046974182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5178045034408569},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5127025842666626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45969170331954956},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4587668478488922},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4583515524864197},{"id":"https://openalex.org/keywords/ternary-operation","display_name":"Ternary operation","score":0.4100344777107239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26387906074523926},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07695135474205017}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7094454765319824},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6892178058624268},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6017819046974182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5178045034408569},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5127025842666626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45969170331954956},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4587668478488922},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4583515524864197},{"id":"https://openalex.org/C64452783","wikidata":"https://www.wikidata.org/wiki/Q1524945","display_name":"Ternary operation","level":2,"score":0.4100344777107239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26387906074523926},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07695135474205017},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1536414.1536480","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W135467536","https://openalex.org/W189738013","https://openalex.org/W426567240","https://openalex.org/W1603326665","https://openalex.org/W1605256314","https://openalex.org/W1970259241","https://openalex.org/W1986970296","https://openalex.org/W1997124225","https://openalex.org/W2003104918","https://openalex.org/W2014482556","https://openalex.org/W2027665018","https://openalex.org/W2078726861","https://openalex.org/W2088518924","https://openalex.org/W2108684595","https://openalex.org/W2129210705","https://openalex.org/W2161715626","https://openalex.org/W2166517878","https://openalex.org/W2167049470","https://openalex.org/W4242124034"],"related_works":["https://openalex.org/W2070443794","https://openalex.org/W2928193004","https://openalex.org/W2914488349","https://openalex.org/W1994030850","https://openalex.org/W260863705","https://openalex.org/W3181709876","https://openalex.org/W1983915440","https://openalex.org/W4367665025","https://openalex.org/W3095925971","https://openalex.org/W2005304136"],"abstract_inverted_index":{"We":[0,97],"prove":[1],"lower":[2,107,185,199],"bounds":[3,186,200],"on":[4,102,195],"the":[5,22,106,175,183],"redundancy":[6],"necessary":[7],"to":[8,21],"represent":[9,40,129],"a":[10,16,57,135],"set":[11],"S":[12],"of":[13,18,49,67,124,131,137,142,156],"objects":[14],"using":[15],"number":[17],"bits":[19,51,66,144,155],"close":[20],"information-theoretic":[23],"minimum":[24],"log2":[25,162],"|S|,":[26],"while":[27,55,148],"answering":[28,149],"various":[29],"queries":[30,151],"by":[31,63,82,120,152],"probing":[32,64,121,153],"few":[33],"bits.":[34,127],"Our":[35],"main":[36],"results":[37,101,170],"are:":[38],"To":[39,128],"n":[41,115,126,138],"ternary":[42],"values":[43],"t":[44],"\u2208":[45,53,61,146],"{0,1,2}n":[46],"in":[47,140,198],"terms":[48,141],"u":[50,71,91,109,143,160],"b":[52,145],"{0,1}u":[54,147],"accessing":[56],"single":[58],"value":[59],"ti":[60,119],"{0,1,2}":[62],"q":[65,154],"b,":[68,157],"one":[69,122,158],"needs":[70,159],"\u2265":[72,110,161],"(log2":[73,111],"3)n":[74,94,112],"+":[75,95,113,164],"n/2O(q).":[76],"This":[77],"matches":[78],"an":[79],"exciting":[80],"representation":[81],"Patrascu":[83],"(FOCS":[84],"2008),":[85],"later":[86],"refined":[87],"with":[88],"Thorup,":[89],"where":[90],"\u2264":[92],"(log_2":[93],"n/2\u03a9(q).":[96],"also":[98],"note":[99],"that":[100],"logarithmic":[103],"forms":[104],"imply":[105],"bound":[108],"n/logO(1)":[114],"if":[116,174],"we":[117,191],"access":[118],"cell":[123],"log":[125,167],"sets":[130],"size":[132],"n/3":[133],"from":[134],"universe":[136],"elements":[139],"membership":[150],"n/(n/3)":[163],"n/2O(q)":[165],"-":[166],"n.":[168],"Both":[169],"above":[171],"hold":[172],"even":[173],"probe":[176],"locations":[177],"are":[178,182],"determined":[179],"adaptively.":[180],"Ours":[181],"first":[184],"for":[187,201],"these":[188],"fundamental":[189],"problems;":[190],"obtain":[192],"them":[193],"drawing":[194],"ideas":[196],"used":[197],"locally":[202],"decodable":[203],"codes.":[204]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}