{"id":"https://openalex.org/W4416018220","doi":"https://doi.org/10.4230/lipics.cpm.2026.9","title":"Indexing and Encoding Arrays for Element Distinctness Queries","display_name":"Indexing and Encoding Arrays for Element Distinctness Queries","publication_year":2025,"publication_date":"2025-11-04","ids":{"openalex":"https://openalex.org/W4416018220","doi":"https://doi.org/10.4230/lipics.cpm.2026.9"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25935","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.9","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009550388","display_name":"Ivor van der Hoog","orcid":"https://orcid.org/0009-0006-2624-0231"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Hoog, Ivor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004695759","display_name":"Eva Rotenberg","orcid":"https://orcid.org/0000-0001-5853-7909"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rotenberg, Eva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5021826063","display_name":"Daniel Rutschmann","orcid":"https://orcid.org/0009-0005-6838-2628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rutschmann, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30990886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4115999937057495,"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.4115999937057495,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2766000032424927,"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/T12288","display_name":"Optimization and Search Problems","score":0.20110000669956207,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6137999892234802},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.5767999887466431},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5557000041007996},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4514000117778778},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4505999982357025},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43810001015663147},{"id":"https://openalex.org/keywords/maximal-element","display_name":"Maximal element","score":0.4099000096321106},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.40880000591278076}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6165000200271606},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6137999892234802},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6097000241279602},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5767999887466431},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5557000041007996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48510000109672546},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4505999982357025},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43810001015663147},{"id":"https://openalex.org/C196773441","wikidata":"https://www.wikidata.org/wiki/Q1475294","display_name":"Maximal element","level":3,"score":0.4099000096321106},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40880000591278076},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33059999346733093},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.2921000123023987},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2732999920845032},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25935","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.9","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:arXiv.org:2511.02954","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.02954","pdf_url":"https://arxiv.org/pdf/2511.02954","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.02954","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.02954","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"},{"id":"doi:10.4230/lipics.cpm.2026.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.9","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:25935","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.9","pdf_url":null,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"element":[1,98,238,279],"distinctness":[2,99,239,280],"problem":[3,33,251],"takes":[4],"as":[5],"input":[6,85,122],"a":[7,14,31,35,149,185,202,276],"list":[8],"$I$":[9,25,66,134,196],"of":[10,64,106,130,151,252],"$n$":[11],"values":[12],"from":[13],"totally":[15],"ordered":[16],"universe":[17],"and":[18,67,153,188,267,281],"the":[19,61,75,84,104,109,127,131,249,282],"goal":[20],"is":[21,30,148,201],"to":[22,53,103],"decide":[23],"whether":[24],"contains":[26],"any":[27,56,121,179],"duplicates.":[28,88],"It":[29],"well-studied":[32],"with":[34,166,197,226],"classical":[36,243],"worst-case":[37,159,244],"$\u03a9(n":[38,76],"\\log":[39,77,205,217,229],"n)$":[40,78,206],"comparison-based":[41,94],"lower":[42,50,95,118,174],"bound":[43,51,79,175],"by":[44,135,157],"Fredman.":[45],"At":[46],"first":[47],"glance,":[48],"this":[49,113,225],"appears":[52],"rule":[54],"out":[55],"algorithm":[57,181,190,213,262],"more":[58],"efficient":[59],"than":[60,208],"naive":[62],"approach":[63],"sorting":[65],"comparing":[68],"adjacent":[69],"elements.":[70,143],"However,":[71],"upon":[72],"closer":[73],"inspection,":[74],"does":[80],"not":[81],"apply":[82],"if":[83],"has":[86],"many":[87],"We":[89,170,223,246,255],"therefore":[90],"ask:":[91],"Are":[92],"there":[93,183],"bounds":[96,236],"for":[97,178,193,219,237],"that":[100,140,240,257],"are":[101],"sensitive":[102],"amount":[105],"duplicates":[107,132],"in":[108,133],"input?":[110],"To":[111],"address":[112],"question,":[114],"we":[115,125,154],"derive":[116],"instance-specific":[117],"bounds.":[119],"For":[120],"instance":[123],"$I$,":[124],"represent":[126],"combinatorial":[128],"structure":[129],"an":[136,172,189,227,269],"undirected":[137],"graph":[138,146,186],"$G(I)$":[139],"connects":[141],"identical":[142],"Each":[144],"such":[145],"$G$":[147,187],"union":[150],"cliques,":[152],"study":[155,248],"algorithms":[156],"their":[158],"running":[160],"time":[161],"over":[162],"all":[163,194,220],"inputs":[164,195],"$I'$":[165],"$G(I')":[167],"\\cong":[168,199],"G$.":[169],"establish":[171],"adversarial":[173],"showing":[176],"that,":[177,192],"deterministic":[180,212,231,259,272],"$\\mathcal{A}$,":[182],"exists":[184],"$\\mathcal{A}'$":[191],"$G(I)":[198],"G$,":[200],"factor":[203],"$O(\\log":[204,228,270],"faster":[207],"$\\mathcal{A}$.":[209],"Consequently,":[210],"no":[211,258],"can":[214,263],"be":[215,264],"$o(\\log":[216,265],"n)$-competitive":[218,230,271],"graphs":[221],"$G$.":[222],"complement":[224],"algorithm,":[232],"thereby":[233],"obtaining":[234],"tight":[235],"go":[241],"beyond":[242],"analysis.":[245],"subsequently":[247],"related":[250],"set":[253,260,283],"intersection.":[254],"show":[256],"intersection":[261,284],"n)$-competitive,":[266],"provide":[268],"algorithm.":[273],"This":[274],"shows":[275],"separation":[277],"between":[278],"problem.":[285]},"counts_by_year":[],"updated_date":"2026-06-12T08:23:45.883708","created_date":"2025-11-07T00:00:00"}