{"id":"https://openalex.org/W7163872903","doi":"https://doi.org/10.4230/lipics.cpm.2026.25","title":"Compressed Index with Construction in Compressed Space","display_name":"Compressed Index with Construction in Compressed Space","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163872903","doi":"https://doi.org/10.4230/lipics.cpm.2026.25"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25951","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.25","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.25/LIPIcs.CPM.2026.25.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.25/LIPIcs.CPM.2026.25.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027443457","display_name":"Dmitry Kosolobov","orcid":"https://orcid.org/0000-0002-2909-2952"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Kosolobov, Dmitry","raw_affiliation_strings":["St. Petersburg State University, Russia"],"raw_orcid":"https://orcid.org/0000-0002-2909-2952","affiliations":[{"raw_affiliation_string":"St. Petersburg State University, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027443457"],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94250628,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.84170001745224,"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.84170001745224,"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/T11567","display_name":"semigroups and automata theory","score":0.045499999076128006,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03200000151991844,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6420000195503235},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.6291999816894531},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.522599995136261},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5202000141143799},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.47209998965263367},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4350999891757965},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.4196000099182129},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4075999855995178}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.675599992275238},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6420000195503235},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.6291999816894531},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5440000295639038},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.522599995136261},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5202000141143799},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48190000653266907},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.47209998965263367},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4350999891757965},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40630000829696655},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37450000643730164},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.3718000054359436},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25951","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.25","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.25/LIPIcs.CPM.2026.25.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.cpm.2026.25","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.25","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25951","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.25","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.25/LIPIcs.CPM.2026.25.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.572521984577179}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163872903.pdf","grobid_xml":"https://content.openalex.org/works/W7163872903.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Suppose":[0],"that":[1,185],"we":[2],"are":[3,205],"given":[4],"a":[5,23,105,139],"string":[6,19,48,102],"s":[7,32,46,103],"of":[8,21,49,65,135],"length":[9,50],"n":[10,164],"over":[11],"an":[12,29],"alphabet":[13,169],"{0,1,\u2026,n^O(1)}":[14],"and":[15,67,120,148,165,171,192],"\u03b4":[16,177,208],"is":[17,62,71,151,157,167,181],"the":[18,63,78,85,101,117,121,124,149,168,182],"complexity":[20],"s,":[22],"known":[24,155],"compression":[25],"measure.":[26],"We":[27],"describe":[28],"index":[30,86,113,184],"on":[31,100],"with":[33,108,174,193],"O(\u03b4log(n/\u03b4))":[34,109,175],"space,":[35],"measured":[36],"in":[37,45,52,77,90,104,123],"O(log":[38],"n)-bit":[39],"machine":[40],"words,":[41],"which":[42],"can":[43,87,127,186],"search":[44,142],"any":[47,72],"m":[51],"O(m":[53],"+":[54,56],"(occ":[55],"1)log^\u03b5":[57],"n)":[58,93],"time,":[59],"where":[60,160],"occ":[61],"number":[64],"occurrences":[66],"\u03b5":[68],">":[69],"0":[70],"fixed":[73],"constant":[74],"(the":[75,154],"big-O":[76],"space":[79,150,191],"bound":[80],"hides":[81],"factor":[82],"1/\u03b5).":[83],"Crucially,":[84],"be":[88,128,187],"built":[89],"O(n":[91],"log":[92,211],"expected":[94],"time":[95,126,143,195],"by":[96,130],"one":[97],"left-to-right":[98],"pass":[99],"streaming":[106],"fashion":[107],"construction":[110,125],"space.":[111],"The":[112,141],"does":[114],"not":[115],"use":[116],"Karp-Rabin":[118],"fingerprints,":[119],"randomization":[122],"eliminated":[129],"using":[131],"deterministic":[132],"dictionaries":[133],"instead":[134],"hash":[136],"tables":[137],"(with":[138],"slowdown).":[140],"matches":[144],"currently":[145],"best":[146],"results":[147],"almost":[152],"optimal":[153],"optimum":[156],"O(\u03b4log":[158],"n/(\u03b4\u03b1)),":[159],"\u03b1":[161],"=":[162,178],"log_\u03c3":[163],"\u03c3":[166],"size,":[170],"it":[172],"coincides":[173],"when":[176],"O(n/\u03b1\u00b2)).":[179],"This":[180],"first":[183],"constructed":[188],"within":[189],"such":[190,194],"guarantees.":[196],"To":[197],"avoid":[198],"uninteresting":[199],"marginal":[200],"cases,":[201],"all":[202],"above":[203],"bounds":[204],"stated":[206],"for":[207],"\u2265":[209],"\u03a9(log":[210],"n).":[212]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}