{"id":"https://openalex.org/W2058766517","doi":"https://doi.org/10.5555/1070432.1070435","title":"Lower bounds on the size of selection and rank indexes","display_name":"Lower bounds on the size of selection and rank indexes","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-23","ids":{"openalex":"https://openalex.org/W2058766517","doi":"https://doi.org/10.5555/1070432.1070435","mag":"2058766517"},"language":"en","primary_location":{"id":"mag:2058766517","doi":"https://doi.org/10.5555/1070432.1070435","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/soda/soda2005.html#Miltersen05","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2058766517"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5006968747","display_name":"Peter Bro Miltersen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Bro Miltersen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5006968747"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7474,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.97090517,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"12"},"is_retracted":false,"is_pulled":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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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/T10317","display_name":"Advanced Database Systems and Queries","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/selection-index","display_name":"selection index","score":0.9940000176429749},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.6650000214576721},{"id":"https://openalex.org/keywords/index-size","display_name":"index size","score":0.5099999904632568},{"id":"https://openalex.org/keywords/query-time","display_name":"query response time","score":0.621999979019165},{"id":"https://openalex.org/keywords/bit-strings","display_name":"bit strings","score":0.550000011920929},{"id":"https://openalex.org/keywords/data-structures","display_name":"data structures","score":0.4650000035762787},{"id":"https://openalex.org/keywords/redundancy","display_name":"redundancy","score":0.6060000061988831},{"id":"https://openalex.org/keywords/random-access-machines","display_name":"random access machines","score":0.5979999899864197}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7005900144577026},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6797517538070679},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6218138933181763},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.617594838142395},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5853222012519836},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.5287739038467407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5075441598892212},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.5066822171211243},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4881218373775482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4601699709892273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41742339730262756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39857378602027893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3400529623031616},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15826234221458435},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.09456053376197815},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":"mag:2058766517","doi":"https://doi.org/10.5555/1070432.1070435","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/soda/soda2005.html#Miltersen05","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1509727978","https://openalex.org/W2114790712","https://openalex.org/W2149243190"],"related_works":["https://openalex.org/W1977986119","https://openalex.org/W7114170626","https://openalex.org/W2753337496","https://openalex.org/W4254779780","https://openalex.org/W1965268455","https://openalex.org/W7098434259","https://openalex.org/W2767613037","https://openalex.org/W7096022933","https://openalex.org/W4312423556"],"abstract_inverted_index":{"The":[0,42,82],"rank":[1,27],"index":[2,44,65,90,110,130],"problem":[3,45],"is":[4,30,46,63,97],"the":[5,47,64,67,93,104,126,129,137,141],"following:":[6,48],"Preprocess":[7,49],"and":[8,50,103,139],"store":[9,51],"a":[10,17,52,147],"bit":[11,53],"string":[12,54,95],"x":[13,55,86,96],"\u2208":[14,56],"{0,1}n":[15,57],"on":[16],"random":[18],"access":[19],"machine":[20],"with":[21,112],"word":[22],"size":[23,127],"w":[24],"so":[25,58],"that":[26,59],"queries":[28,61],"What":[29,62],"\u03a3ji=1xi?":[31],"for":[32,72,145],"arbitrary":[33,73],"values":[34,74],"of":[35,66,75,128,136],"j":[36,76],"can":[37,77],"afterwards":[38,78],"be":[39,79,88],"easily":[40,80],"answered.":[41,81],"selection":[43,60],"j'th":[68],"1-bit":[69],"in":[70,100,116,122,132],"x?":[71],"data":[83],"structure":[84],"representing":[85],"should":[87],"an":[89,108],"structure,":[91],"i.e.,":[92],"n-bit":[94],"kept":[98],"verbatim":[99],"[n/w]":[101],"words":[102],"preprocessing":[105],"phase":[106],"adds":[107],"r-bit":[109],"\u03c6(x)":[111],"additional":[113],"information":[114],"contained":[115],"[r/w]":[117],"words.":[118],"We":[119],"are":[120],"interested":[121],"tradeoffs":[123],"between":[124],"r,":[125],"measured":[131],"bits":[133],"(the":[134],"redundancy":[135],"scheme),":[138],"t,":[140],"worst":[142],"case":[143],"time":[144],"answering":[146],"query.":[148]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2058766517","counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
