Dylan Hendrickson

Available identifiers

Publication	Date of Publication	Type
Lower bounds on retroactive data structures	2024-09-11	Paper
Pushing blocks via checkable gadgets: PSPACE-completeness of push-1f and block/box dude	2024-05-16	Paper
Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles	2024-05-14	Paper
The Legend of Zelda: the complexity of mechanics	2024-04-09	Paper
Complexity of simple folding of mixed orthogonal crease patterns	2024-04-09	Paper
Orthogonal fold \& cut	2024-04-09	Paper
Traversability, reconfiguration, and reachability in the gadget framework	2023-11-17	Paper
https://portal.mardi4nfdi.de/entity/Q6065414	2023-11-14	Paper
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets	2023-08-01	Paper
\(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete	2023-02-07	Paper
Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875768	2023-02-03	Paper
This Game Is Not Going To Analyze Itself	2023-02-02	Paper
PSPACE-completeness of reversible deterministic systems	2022-12-09	Paper
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets	2022-07-13	Paper
Traversability, reconfiguration, and reachability in the gadget framework	2022-07-13	Paper

This page was built for person: Dylan Hendrickson