{"id":"https://openalex.org/W2965828257","doi":"https://doi.org/10.4230/lipics.icalp.2019.95","title":"Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps","display_name":"Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2965828257","doi":"https://doi.org/10.4230/lipics.icalp.2019.95","mag":"2965828257"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:10671","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95","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":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Thorup, Mikkel","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark","University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048299120","display_name":"Or Zamir","orcid":"https://orcid.org/0000-0003-4908-878X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Zamir, Or","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel Aviv University, Israel","Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Zwick, Uri","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel Aviv University, Israel","Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039232562"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.1674,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4413633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9690999984741211,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9690999984741211,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9592999815940857,"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/T11671","display_name":"Fuzzy and Soft Set Theory","score":0.951200008392334,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523370623588562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39818018674850464},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.36576348543167114}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523370623588562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39818018674850464},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.36576348543167114}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:10671","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95","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":"","raw_type":"InProceedings"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/452f1322-9f06-4d83-90a6-c01a18d36f48","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/452f1322-9f06-4d83-90a6-c01a18d36f48","pdf_url":"https://curis.ku.dk/ws/files/227130988/Thorup_Dynamic_Ordered_Sets_with_Approximate_Queries_.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Thorup , M , Zamir , O & Zwick , U 2019 , Dynamic ordered sets with approximate queries, approximate heaps and soft heaps . in I Chatzigiannakis , C Baier , S Leonardi & P Flocchini (eds) , 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 . , 95 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Leibniz International Proceedings in Informatics, LIPIcs , vol. 132 , 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 , Patras , Greece , 09/07/2019 . https://doi.org/10.4230/LIPIcs.ICALP.2019.95","raw_type":"contributionToPeriodical"},{"id":"doi:10.4230/lipics.icalp.2019.95","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2019.95","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":""},{"id":"mag:2965828257","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2019/10671/pdf/LIPIcs-ICALP-2019-95.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418971","display_name":"International Colloquium on Automata, Languages and Programming","issn_l":null,"issn":null,"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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Colloquium on Automata, Languages and Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:10671","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.95","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":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"We":[0,96,133],"consider":[1],"word":[2,207,223,291,309],"RAM":[3,208,224,292],"data":[4,103],"structures":[5,66,104],"for":[6,294,312],"maintaining":[7],"ordered":[8],"sets":[9],"of":[10,57,94,100,166,185,218,285,316],"integers":[11],"whose":[12,27],"select":[13,47,59,196,227],"and":[14,48,124,144,157,173,197,206,273],"rank":[15,49,198],"operations":[16,71,126,220],"are":[17,61,72,83,87,190],"allowed":[18],"to":[19,45,80,115,268],"return":[20],"approximate":[21,46,51,58,62,69,75,81,88,121,138,142,216,232,239,248,261],"results,":[22],"i.e.,":[23,141],"ranks,":[24],"or":[25,112],"items":[26,298],"rank,":[28,123],"differ":[29],"by":[30],"less":[31],"than":[32,231,244,259],"Delta":[33],"from":[34],"the":[35,98,102,145,158,215,222,245,269,308,313,319],"exact":[36],"answer,":[37],"where":[38,305],"Delta=Delta(n)":[39],"is":[40,50,228,241,257,307,335,340],"an":[41,135,152,210,277,336],"error":[42],"parameter.":[43],"Related":[44,79],"(one-dimensional)":[52],"nearest-neighbor.":[53],"A":[54],"special":[55],"case":[56],"queries":[60],"min":[63,70,139,240],"queries.":[64],"Data":[65],"that":[67,179,238,253,282],"support":[68],"known":[73,286],"as":[74,276],"heaps":[76,82,89,156,256],"(priority":[77],"queues).":[78],"soft":[84,155,255],"heaps,":[85,143],"which":[86],"with":[90,344],"a":[91,163,283,289],"different":[92],"notion":[93],"approximation.":[95],"prove":[97,134,151],"optimality":[99],"all":[101],"presented,":[105],"either":[106],"through":[107,113],"matching":[108,129],"cell-probe":[109,130],"lower":[110,131],"bounds,":[111],"equivalences":[114],"well":[116],"studied":[117],"static":[118,146],"problems.":[119],"For":[120],"select,":[122],"nearest-neighbor":[125],"we":[127,150,251,280],"get":[128],"bounds.":[132],"equivalence":[136,153],"between":[137,154,214,265,271],"operations,":[140,187],"partitioning":[147],"problem.":[148],"Finally,":[149,275],"classical":[159],"sorting":[160,272,296],"problem,":[161],"on":[162],"smaller":[164],"number":[165],"items.":[167],"Our":[168,331],"results":[169],"have":[170,199],"many":[171],"interesting":[172,211,278],"unexpected":[174],"consequences.":[175],"It":[176,234],"turns":[177,236],"out":[178,237],"approximation":[180],"greatly":[181],"speeds":[182],"up":[183],"some":[184],"these":[186,219],"while":[188,195],"others":[189],"almost":[191],"unaffected.":[192],"In":[193],"particular,":[194],"identical":[200],"operation":[201],"times,":[202],"both":[203],"in":[204,221,299],"comparison-based":[205],"implementations,":[209],"separation":[212],"emerges":[213],"versions":[217],"model.":[225],"Approximate":[226],"much":[229],"faster":[230,243],"rank.":[233],"also":[235],"exponentially":[242],"more":[246],"general":[247],"select.":[249],"Next,":[250],"show":[252],"implementing":[254,260],"harder":[258],"heaps.":[262],"The":[263],"relation":[264,270],"them":[266],"corresponds":[267],"partitioning.":[274],"byproduct,":[279],"observe":[281],"combination":[284],"techniques":[287],"yields":[288],"deterministic":[290,322],"algorithm":[293],"(exactly)":[295],"n":[297],"O(n":[300],"log":[301,326,327],"log_w":[302,329],"n)":[303],"time,":[304],"w":[306,339],"length.":[310],"Even":[311],"easier":[314],"problem":[315],"finding":[317],"duplicates,":[318],"best":[320],"previous":[321],"bound":[323,334],"was":[324],"O(min{n":[325],"n,n":[328],"n}).":[330],"new":[332],"unifying":[333],"improvement":[337],"when":[338],"sufficiently":[341],"large":[342],"compared":[343],"n.":[345]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}