Author of the publication

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.

, , , , , and . FUN, volume 157 of LIPIcs, page 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). J. Inf. Process., (2020)Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard., , , and . ISAAC, volume 181 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard., , and . ITCS, volume 151 of LIPIcs, page 62:1-62:42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Characterizing Universal Reconfigurability of Modular Pivoting Robots., , , , , , , , , and . CoRR, (2020)Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude., , , , , and . FUN, volume 226 of LIPIcs, page 3:1-3:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Lower Bounds on Retroactive Data Structures., , , and . ISAAC, volume 248 of LIPIcs, page 32:1-32:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , and . Algorithmica, 85 (11): 3453-3486 (November 2023)Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets., , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 187-198. Springer, (2022)PSPACE-Completeness of Reversible Deterministic Systems., , , and . MCU, volume 13419 of Lecture Notes in Computer Science, page 91-108. Springer, (2022)Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets., , , , , and . FUN, volume 157 of LIPIcs, page 3:1-3:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)