{"id":"https://openalex.org/W7161247330","doi":"https://doi.org/10.4230/lipics.fun.2026.9","title":"MIDTERM Is a Deterministic Technique to Exit Recursive Mazes","display_name":"MIDTERM Is a Deterministic Technique to Exit Recursive Mazes","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7161247330","doi":"https://doi.org/10.4230/lipics.fun.2026.9"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25728","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.9/LIPIcs.FUN.2026.9.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","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.9/LIPIcs.FUN.2026.9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054666119","display_name":"Charles Bouillaguet","orcid":"https://orcid.org/0000-0001-9416-6244"},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210091437","display_name":"Sorbonne Paris Cit\u00e9","ror":"https://ror.org/001z21q04","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210091437"]},{"id":"https://openalex.org/I51101395","display_name":"Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne","ror":"https://ror.org/002t25c44","country_code":"FR","type":"education","lineage":["https://openalex.org/I51101395"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bouillaguet, Charles","raw_affiliation_strings":["LIP6 laboratory, Sorbonne Universit\u00e9, Paris, France"],"raw_orcid":"https://orcid.org/0000-0001-9416-6244","affiliations":[{"raw_affiliation_string":"LIP6 laboratory, Sorbonne Universit\u00e9, Paris, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I4210091437","https://openalex.org/I51101395"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078370191","display_name":"Orel Cosseron","orcid":"https://orcid.org/0000-0001-9481-8935"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cosseron, Orel","raw_affiliation_strings":["Independent researcher, Paris, France"],"raw_orcid":"https://orcid.org/0000-0001-9481-8935","affiliations":[{"raw_affiliation_string":"Independent researcher, Paris, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"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.41247766,"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/T12029","display_name":"DNA and Biological Computing","score":0.435699999332428,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.435699999332428,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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/T11567","display_name":"semigroups and automata theory","score":0.05590000003576279,"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/T11269","display_name":"Algorithms and Data Compression","score":0.04320000112056732,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5099999904632568},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.47940000891685486},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.32249999046325684},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3125999867916107}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5371000170707703},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5099999904632568},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.47940000891685486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47429999709129333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44200000166893005},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3118000030517578},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28679999709129333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2802000045776367},{"id":"https://openalex.org/C137345334","wikidata":"https://www.wikidata.org/wiki/Q7303350","display_name":"Recursive partitioning","level":2,"score":0.27480000257492065}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25728","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.9/LIPIcs.FUN.2026.9.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":"doi:10.4230/lipics.fun.2026.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2026.9","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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:25728","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol366-fun2026/LIPIcs.FUN.2026.9/LIPIcs.FUN.2026.9.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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7161247330.pdf","grobid_xml":"https://content.openalex.org/works/W7161247330.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"recursive":[1,27,63],"maze":[2,5,21,64],"is":[3,101,108],"a":[4,62,69,74,88,91,109,117,131,138],"that":[6,29,61,79],"contains":[7],"copies":[8,14],"of":[9,15],"itself":[10],"(that":[11],"themselves":[12],"contain":[13],"themselves,":[16],"etc.).":[17],"To":[18],"exit":[19,83],"the":[20,24,59,77],"or":[22],"reach":[23],"goal,":[25],"each":[26],"block":[28],"has":[30,53],"been":[31,54],"entered":[32],"must":[33],"be":[34,66,104],"exited.":[35],"These":[36],"once-popular":[37],"puzzles":[38],"are":[39],"difficult":[40],"to":[41,81,86,103,125,141],"solve":[42],"by":[43,68,95],"hand,":[44],"and":[45,106],"this":[46,113],"begs":[47],"for":[48,112],"an":[49,82,97],"algorithmic":[50],"solution.":[51],"It":[52],"observed":[55],"many":[56],"times":[57],"in":[58,90],"past":[60],"can":[65],"represented":[67],"deterministic":[70],"pushdown":[71],"automaton.":[72,98],"Finding":[73],"path,":[75],"possibly":[76],"shortest,":[78],"leads":[80],"therefore":[84],"reduces":[85],"finding":[87],"word":[89],"context-free":[92],"language":[93],"described":[94],"such":[96],"The":[99],"problem":[100],"well-known":[102],"decidable,":[105],"there":[107],"classical":[110],"algorithm":[111],"task.":[114],"We":[115],"present":[116],"new":[118],"algorithm,":[119],"Midterm,":[120],"with":[121],"improved":[122],"complexity":[123],"compared":[124],"existing":[126],"solutions.":[127],"Midterm":[128],"improves":[129],"on":[130],"previous":[132],"attempt":[133],"called":[134],"Longterm":[135],"(Obviously":[136],"Not":[137],"Good":[139],"Technique":[140],"Exit":[142],"Recursive":[143],"Mazes).":[144]},"counts_by_year":[],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2026-05-16T00:00:00"}