{"id":"https://openalex.org/W2014482556","doi":"https://doi.org/10.1137/s0097539702405292","title":"Are Bitvectors Optimal?","display_name":"Are Bitvectors Optimal?","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2014482556","doi":"https://doi.org/10.1137/s0097539702405292","mag":"2014482556"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702405292","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702405292","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5083983355","display_name":"Harry Buhrman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Buhrman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006968747","display_name":"Peter Bro Miltersen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. B. Miltersen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080324608","display_name":"Jaikumar Radhakrishnan","orcid":"https://orcid.org/0000-0002-3875-4620"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Radhakrishnan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"S. Venkatesh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Venkatesh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3895,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.61831883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"6","first_page":"1723","last_page":"1744"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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/omega","display_name":"Omega","score":0.7289705276489258},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6615633964538574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6534658074378967},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6525078415870667},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5428836345672607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5086556077003479},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4970293343067169},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4815521538257599},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44205474853515625},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.43771764636039734},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4201824963092804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26983189582824707},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14446184039115906},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09984588623046875}],"concepts":[{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7289705276489258},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6615633964538574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6534658074378967},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6525078415870667},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5428836345672607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5086556077003479},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4970293343067169},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4815521538257599},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44205474853515625},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.43771764636039734},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4201824963092804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26983189582824707},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14446184039115906},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09984588623046875},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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":9,"locations":[{"id":"doi:10.1137/s0097539702405292","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702405292","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/b09935c6-96e4-4588-aaa2-00785367e130","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/are-bitvectors-optimal(b09935c6-96e4-4588-aaa2-00785367e130).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H M, Bro Miltersen, P, Radhakrishnan, J & Venkatesch, S 2000, Are bitvectors optimal? in Proceedings of Symposium on Theory of Computing. pp. 449-458.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/ee84bba3-f3d2-4a9b-8245-1078d32f3809","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/are-bitvectors-optimal(ee84bba3-f3d2-4a9b-8245-1078d32f3809).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H M, Miltersen, P B & Radhakrishnan, J 2002, 'Are bitvectors optimal', SIAM Journal on Computing, vol. 31, no. 6, pp. 1723-1744. https://doi.org/10.1137/S0097539702405292","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.5464","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.5464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uvic.ca/~venkat/papers/siam.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/~bromille/Papers/bitvector.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.7673","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.aau.dk/~bromille/Papers/stoc00.ps","raw_type":"text"},{"id":"pmh:oai:dare.uva.nl:publications/ee84bba3-f3d2-4a9b-8245-1078d32f3809","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/are-bitvectors-optimal(ee84bba3-f3d2-4a9b-8245-1078d32f3809).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buhrman, H M, Miltersen, P B & Radhakrishnan, J 2002, 'Are bitvectors optimal', SIAM Journal on Computing, vol. 31, no. 6, pp. 1723-1744. https://doi.org/10.1137/S0097539702405292","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/6d2b5740-8161-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/6d2b5740-8161-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buhrman, H, Miltersen, P B, Radhakrishnan, J & Venkatesh, S 2002, 'Are Bitvectors Optimal?', S I A M Journal on Computing, vol. 31, no. 6, pp. 1723-1744. https://doi.org/10.1137/S0097539702405292","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/b09935c6-96e4-4588-aaa2-00785367e130","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/are-bitvectors-optimal(b09935c6-96e4-4588-aaa2-00785367e130).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of Symposium on Theory of Computing, 449 - 458","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1985203234","https://openalex.org/W1993022201","https://openalex.org/W1998918799","https://openalex.org/W2004227827","https://openalex.org/W2006949464","https://openalex.org/W2012584108","https://openalex.org/W2023930099","https://openalex.org/W2047619746","https://openalex.org/W2055034980","https://openalex.org/W2055618684","https://openalex.org/W2078677252","https://openalex.org/W2079668749","https://openalex.org/W2164604747","https://openalex.org/W2165461157","https://openalex.org/W2165621523","https://openalex.org/W2295319256","https://openalex.org/W2745281314"],"related_works":["https://openalex.org/W4296603869","https://openalex.org/W3164081298","https://openalex.org/W3104828215","https://openalex.org/W3157898686","https://openalex.org/W2128020755","https://openalex.org/W2949903564","https://openalex.org/W4308830832","https://openalex.org/W3184929353","https://openalex.org/W2950011701","https://openalex.org/W2952856725"],"abstract_inverted_index":{"We":[0,46,79,117,143,200,261],"study":[1,47],"the":[2,30,44,57,77,169,240,250,267,277],"it":[3,25],"static":[4,268],"membership":[5,97,269],"problem:":[6],"Given":[7],"a":[8,18,71,88,100,212],"set":[9,195],"S":[10,127],"of":[11,21,29,62,74,76,108,171,194,215,237,259,279],"at":[12,114,135],"most":[13,115,136],"n":[14,216],"keys":[15],"drawn":[16],"from":[17],"universe":[19],"U":[20],"size":[22],"m,":[23],"store":[24,151],"so":[26],"that":[27,52,90,103,120,145,150,204,220],"queries":[28,68,98,125,139,158,222,245],"form":[31],"\"Is":[32],"u":[33],"in":[34,126,141,247],"S?\"":[35],"can":[36,174],"be":[37,175],"answered":[38],"by":[39,69],"making":[40],"few":[41],"accesses":[42],"to":[43,56,131,177,207,244],"memory.":[45,78],"schemes":[48,119,149,186,265],"for":[49,82,124,138,180,266],"this":[50],"problem":[51,270],"use":[53,232,253],"space":[54,275],"close":[55,206],"information":[58],"theoretic":[59],"lower":[60,202],"bound":[61],"$\\Omega(n\\log(\\frac{m}{n}))$":[63],"bits":[64,75,94,155,172,236,258],"and":[65,95,110,156,217,227,271,276],"yet":[66],"answer":[67,157,221],"reading":[70],"small":[72,198],"number":[73,170,278],"show":[80,144,201,272],"that,":[81],"$\\epsilon":[83],">":[84,183],"0$,":[85],"there":[86,146],"is":[87,242],"scheme":[89,251],"stores":[91],"$O(\\frac{n}{\\epsilon^2}\\log":[92],"m)$":[93,154,179,235,257],"answers":[96],"using":[99,159],"randomized":[101],"algorithm":[102],"reads":[104],"just":[105,160,224],"one":[106,161,225],"bit":[107],"memory":[109],"errs":[111],"with":[112,133,197,223],"probability":[113,134,229],"$\\epsilon$.":[116],"consider":[118,263],"make":[121],"no":[122],"error":[123,228,241],"but":[128],"are":[129,166,189],"allowed":[130],"err":[132],"$\\epsilon$":[137,230],"not":[140,246],"S.":[142],"exist":[147],"such":[148],"$O((\\frac{n}{\\epsilon})^2":[152],"\\log":[153,234,255],"bitprobe.":[162],"If":[163],"multiple":[164],"probes":[165],"allowed,":[167],"then":[168,249],"stored":[173],"reduced":[176],"$O(n^{1+\\delta}\\log":[178],"any":[181],"$\\delta":[182],"0$.":[184],"The":[185],"mentioned":[187],"above":[188],"based":[190],"on":[191],"probabilistic":[192],"constructions":[193],"systems":[196],"intersections.":[199],"bounds":[203,210],"come":[205],"our":[208],"upper":[209],"(for":[211],"large":[213],"range":[214],"$\\epsilon$):":[218],"Schemes":[219],"bitprobe":[226],"must":[231,252],"$\\Omega(\\frac{n}{\\epsilon\\log(1/\\epsilon)}":[233],"storage;":[238],"if":[239],"restricted":[243],"S,":[248],"$\\Omega(\\frac{n^2}{\\epsilon^2":[254],"(n/\\epsilon)}\\log":[256],"storage.":[260],"also":[262],"deterministic":[264],"tradeoffs":[273],"between":[274],"probes.":[280]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}