{"id":"https://openalex.org/W7222965883","doi":"https://doi.org/10.48550/arxiv.2610.22546","title":"An improved randomized algorithm for finding sinks of Acyclic Unique Sink Orientations of the binary hypercube","display_name":"An improved randomized algorithm for finding sinks of Acyclic Unique Sink Orientations of the binary hypercube","publication_year":2026,"publication_date":"2026-10-15","ids":{"openalex":"https://openalex.org/W7222965883","doi":"https://doi.org/10.48550/arxiv.2610.22546"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.22546","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.22546","pdf_url":"https://arxiv.org/pdf/2610.22546","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.22546","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049011416","display_name":"Thomas Dueholm Hansen","orcid":null,"observed_orcids":[]},"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":"Hansen, Thomas Dueholm","raw_affiliation_strings":["Blavatnik School of Computer Science and AI , Tel Aviv University , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science and AI , Tel Aviv University , 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","observed_orcids":["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 and AI , Tel Aviv University , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science and AI , Tel Aviv University , Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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.9976000189781189,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/binary-hypercube","display_name":"binary hypercube","score":0.9729999899864197},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.9369999766349792},{"id":"https://openalex.org/keywords/lp-type-problems","display_name":"LP-type problems","score":0.7860000133514404},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.7960000038146973},{"id":"https://openalex.org/keywords/recurrence-relations","display_name":"recurrence relations","score":0.6010000109672546}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6445000171661377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5992000102996826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5878999829292297},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5867999792098999},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5206000208854675},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5069000124931335},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4408000111579895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41290000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.40209999680519104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35409998893737793},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.30410000681877136},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2953999936580658},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.26429998874664307},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2630999982357025},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.22546","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.22546","pdf_url":"https://arxiv.org/pdf/2610.22546","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.22546","doi":"https://doi.org/10.48550/arxiv.2610.22546","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.22546","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,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.22546","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.22546","pdf_url":"https://arxiv.org/pdf/2610.22546","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7222965883.pdf","grobid_xml":"https://content.openalex.org/works/W7222965883.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1981423455","https://openalex.org/W2015432477","https://openalex.org/W2022121413","https://openalex.org/W2030923287","https://openalex.org/W2047614799","https://openalex.org/W2068290327","https://openalex.org/W2074044530","https://openalex.org/W2080654168","https://openalex.org/W2114657710","https://openalex.org/W2128694402","https://openalex.org/W2141076336","https://openalex.org/W2142070606","https://openalex.org/W2152479402","https://openalex.org/W2153460097","https://openalex.org/W2155388558","https://openalex.org/W2158781971","https://openalex.org/W2527712682","https://openalex.org/W4235083118","https://openalex.org/W4239254359","https://openalex.org/W6891364598","https://openalex.org/W7155506213","https://openalex.org/W7167670240"],"related_works":["https://openalex.org/W4239254359","https://openalex.org/W2153460097","https://openalex.org/W2894827708","https://openalex.org/W7097825239","https://openalex.org/W1546466321","https://openalex.org/W4385317178","https://openalex.org/W4409362417","https://openalex.org/W2485187644","https://openalex.org/W2040434620","https://openalex.org/W2597697008"],"abstract_inverted_index":{"Acyclic":[0],"Unique":[1],"Sink":[2],"Orientations":[3],"(AUSOs)":[4],"of":[5,13,37,46,59,66,71,90,106,121,147,189,201,213,225],"the":[6,38,57,63,80,95,104,107,127,132,148,190,214,219,223,226],"binary":[7,81,202],"hypercube":[8,82],"form":[9],"an":[10,111,118],"elegant":[11],"abstraction":[12],"various":[14],"optimization":[15],"problems,":[16,158],"ranging":[17],"from":[18,43],"linear":[19,154],"programs":[20],"whose":[21],"feasibility":[22],"region":[23],"is":[24,62,97,103,126,141,177,196],"a":[25,205,209],"combinatorial":[26],"hypercube,":[27],"to":[28,79],"2-player":[29],"turn-based":[30],"stochastic":[31],"games":[32],"(2TBSGs)":[33],"in":[34,134],"which":[35],"one":[36,45,231],"players":[39],"has":[40],"two":[41,136],"actions":[42],"each":[44],"its":[47,194,197],"states.":[48],"The":[49,87,138,174,199],"currently":[50],"fastest":[51],"known":[52],"randomized":[53,113],"algorithm":[54,65,96,115,140,150,192,227],"for":[55,131,151],"finding":[56],"sink":[58],"such":[60],"AUSOs":[61,203],"Random-Facet":[64,149],"Kalai":[67,161],"(STOC":[68,162,172],"1992),":[69,77,163,166],"and":[70,74,156,167,170,193,208,233,236],"Matou\u0161ek,":[72],"Sharir":[73],"Welzl":[75],"(SoCG":[76],"adapted":[78,215],"by":[83,94,143,160,168,180],"G\u00e4rtner":[84,164],"(RSA":[85],"2002).":[86],"expected":[88,119],"number":[89,120],"vertex":[91],"queries":[92],"made":[93],"at":[98],"most":[99],"$e^{2\\sqrt{n}}$,":[100],"where":[101],"$n$":[102],"dimension":[105],"cube.":[108],"We":[109],"design":[110],"improved":[112,129,139,145,175,191],"sink-finding":[114],"that":[116],"performs":[117],"only":[122,230],"$e^{\\sqrt{(2+o(1))n}}$":[123],"queries.":[124],"This":[125],"first":[128],"bound":[130,176],"problem":[133],"over":[135],"decades.":[137],"obtained":[142],"adapting":[144],"versions":[146],"solving":[152],"general":[153,184],"programs,":[155],"LP-type":[157],"developed":[159],"(FOCS":[165],"Hansen":[169],"Zwick":[171],"2015).":[173],"not":[178,234],"implied":[179],"these":[181],"much":[182,210],"more":[183],"algorithms.":[185],"A":[186],"key":[187],"feature":[188],"analysis":[195,212],"simplicity.":[198],"structure":[200],"enables":[204],"simpler":[206,211],"description":[207],"algorithm.":[216],"In":[217],"particular,":[218],"recurrence":[220],"relations":[221],"bounding":[222],"complexity":[224],"depend":[228],"on":[229],"variable,":[232],"two,":[235],"they":[237],"can":[238],"be":[239],"solved":[240],"using":[241],"fairly":[242],"straightforward":[243],"techniques.":[244]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-10-20T00:00:00"}