Author of the publication

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete.

, , , , , , and . FUN, volume 157 of LIPIcs, page 7:1-7:14. 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

Arithmetic Expression Construction., , , , , , , , , and 3 other author(s). ISAAC, volume 181 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete., , , , , , and . CoRR, (2020)The Legend of Zelda: The Complexity of Mechanics., , , , , , and . CoRR, (2022)1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete., , , , , , and . FUN, volume 157 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Complexity of Reconfiguration in Surface Chemical Reaction Networks., , , , , , , , , and 2 other author(s). DNA, volume 276 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An Optimal Algorithm for Online Freeze-Tag., and . FUN, volume 157 of LIPIcs, page 8:1-8:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)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)An Optimal Algorithm for Online Freeze-tag., and . CoRR, (2019)Orthogonal Fold & Cut., , , , , , and . CoRR, (2022)Complexity of Solo Chess with Unlimited Moves., , , , , and . CoRR, (2023)