{"id":"https://openalex.org/W7154445637","doi":"https://doi.org/10.48550/arxiv.2604.12653","title":"Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps","display_name":"Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps","publication_year":2026,"publication_date":"2026-04-14","ids":{"openalex":"https://openalex.org/W7154445637","doi":"https://doi.org/10.48550/arxiv.2604.12653"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.12653","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12653","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.12653","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021826063","display_name":"Daniel Rutschmann","orcid":"https://orcid.org/0009-0005-6838-2628"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rutschmann, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5021826063"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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.5022000074386597,"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.5022000074386597,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.39719998836517334,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.018699999898672104,"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/sorting-algorithm","display_name":"Sorting algorithm","score":0.6876000165939331},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6359999775886536},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5835000276565552},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5684000253677368},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5450999736785889},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46309998631477356},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4505000114440918},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.40950000286102295},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4077000021934509}],"concepts":[{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6876000165939331},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6359999775886536},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5835000276565552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5819000005722046},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5684000253677368},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5554999709129333},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5450999736785889},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46309998631477356},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4505000114440918},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.40950000286102295},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4068000018596649},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.4041999876499176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.36980000138282776},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36149999499320984},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.2978000044822693},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.289000004529953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28529998660087585},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.2791999876499176},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.12653","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12653","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.12653","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12653","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,114],"1972,":[1],"Fredman":[2],"proposes":[3],"the":[4,34],"problem":[5],"of":[6,36,74,109,147],"sorting":[7,94,130],"under":[8],"partial":[9],"information:":[10],"preprocess":[11,53],"a":[12,133,138],"directed":[13],"acyclic":[14],"graph":[15],"$G$":[16,54],"with":[17,40,84],"vertex":[18],"set":[19],"$X$":[20,26,61],"so":[21],"that":[22,50,144],"you":[23,51],"can":[24,52],"sort":[25,60],"in":[27,55,62],"$O(\\log":[28,63,69,92,110,128],"e(G))$":[29,70,93,129],"time,":[30],"where":[31,88],"$e(G)$":[32],"is":[33],"number":[35],"sorted":[37],"orders":[38],"compatible":[39],"$G$.":[41],"Cardinal,":[42],"Fiorini,":[43],"Joret,":[44],"Jungers":[45],"and":[46,58,68,78,91,101,127],"Munro":[47],"[STOC'10]":[48],"show":[49],"$O(n^{2.5})$":[56],"time":[57,67,87,108,126],"then":[59],"e(G)":[64,111],"+":[65,112],"n)$":[66],"comparisons.":[71],"Recent":[72],"work":[73],"van":[75],"der":[76],"Hoog":[77],"Rutschmann":[79],"[FOCS'24]":[80],"implies":[81],"an":[82,105],"algorithm":[83],"$O(n^\u03c9)$":[85],"preprocessing":[86,125],"$\u03c9<":[89],"2.372$":[90],"time.":[95,131],"Haeupler,":[96],"Hlad\u00edk,":[97],"Iacono,":[98],"Rozho\u0148,":[99],"Tarjan":[100],"T\u011btek":[102],"[SODA'25]":[103],"achieve":[104,118],"overall":[106],"running":[107],"m)$.":[113],"this":[115,122],"paper,":[116],"we":[117,136],"tight":[119],"bounds":[120],"for":[121],"problem:":[123],"$O(m)$":[124],"As":[132],"key":[134],"ingredient,":[135],"design":[137],"new":[139],"fast":[140],"heap":[141],"data":[142],"structure":[143],"might":[145],"be":[146],"independent":[148],"theoretical":[149],"interest.":[150]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-16T00:00:00"}