{"id":"https://openalex.org/W7161278881","doi":"https://doi.org/10.4230/lipics.fun.2026.19","title":"Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level","display_name":"Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7161278881","doi":"https://doi.org/10.4230/lipics.fun.2026.19"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25738","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.19/LIPIcs.FUN.2026.19.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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.19/LIPIcs.FUN.2026.19.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017124525","display_name":"Bernd G\u00e4rtner","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"G\u00e4rtner, Bernd","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-5492-9347","affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019688727","display_name":"Sebastian Haslebacher","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Haslebacher, Sebastian","raw_affiliation_strings":["Department of Computer Science, ETH Z\u00fcrich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-3988-3325","affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5134954154","display_name":"Hung P. Hoang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hoang, Hung P.","raw_affiliation_strings":["Algorithms and Complexity Group, Faculty of Informatics, TU Wien, Austria"],"raw_orcid":"https://orcid.org/0000-0001-7883-4134","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, Faculty of Informatics, TU Wien, Austria","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.55178604,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.20999999344348907,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.20999999344348907,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.17489999532699585,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.11159999668598175,"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/time-complexity","display_name":"Time complexity","score":0.5870000123977661},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5375999808311462},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48240000009536743},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4657000005245209},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.40059998631477356},{"id":"https://openalex.org/keywords/arrival-time","display_name":"Arrival time","score":0.29670000076293945}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5906999707221985},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5870000123977661},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5665000081062317},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48240000009536743},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4657000005245209},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46209999918937683},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31869998574256897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3118000030517578},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25738","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.19/LIPIcs.FUN.2026.19.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":"InProceedings"},{"id":"pmh:doi:10.3929/ethz-c-000801631","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/801631","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"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":"Conference Paper"},{"id":"pmh:doi:10.4230/lipics.fun.2026.19","is_oa":true,"landing_page_url":"https://scottaaronson.blog/?p=5402","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"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":"ConferencePaper"},{"id":"doi:10.4230/lipics.fun.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2026.19","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25738","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.19/LIPIcs.FUN.2026.19.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":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7784929708","display_name":"Structural Analysis in Combinatorial Reconfiguration (SCoRe)","funder_award_id":"ESP 1136425","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161278881.pdf","grobid_xml":"https://content.openalex.org/works/W7161278881.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"ARRIVAL":[0,79],"is":[1,21],"the":[2,19,64],"problem":[3,20],"of":[4,50,56],"deciding":[5],"whether":[6,29],"a":[7,10,15,38,48,54],"token,":[8],"following":[9],"deterministic":[11],"process,":[12],"eventually":[13],"reaches":[14],"designated":[16],"destination.":[17],"While":[18],"known":[22,67],"to":[23,81,95],"lie":[24],"in":[25,34,86],"NP":[26],"\u2229":[27],"CoNP,":[28],"it":[30],"can":[31,83],"be":[32,84],"solved":[33,85],"polynomial":[35,87],"time":[36],"remains":[37],"major":[39],"open":[40],"question.":[41],"In":[42],"this":[43,93],"article,":[44],"we":[45,90],"study":[46],"ladders,":[47],"class":[49],"graphs":[51],"that":[52,78],"constitutes":[53],"family":[55],"worst-case":[57],"instances":[58],"for":[59],"many":[60],"existing":[61],"algorithms,":[62],"including":[63],"currently":[65],"best":[66],"algorithm":[68],"by":[69],"G\u00e4rtner,":[70],"Haslebacher,":[71],"and":[72,89],"Hoang":[73],"(ICALP":[74],"2021).":[75],"We":[76],"show":[77],"restricted":[80],"ladders":[82],"time,":[88],"further":[91],"extend":[92],"result":[94],"stopping":[96],"binary":[97],"simple":[98],"stochastic":[99],"games":[100],"(SSG).":[101]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-05-16T00:00:00"}