Dylan H. Hendrickson

34 papers A* 2A 1B 4C 1Misc 3Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
PSPACE-Completeness of Reversible Deterministic Systems.
Int. J. Found. Comput. Sci.
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2023 — conf
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.
SAND
Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
2023 J jnl
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.
CoRR
Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch
2023 J jnl
Complexity of Simple Folding of Mixed Orthogonal Crease Patterns.
CoRR
Hugo A. Akitaya, Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo, Andy Tockman
2023 J jnl
This Game Is Not Going To Analyze Itself.
CoRR
Aviv Adler, Joshua Ani, Lily Chung, Michael J. Coulombe, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2023 J jnl
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.
Theor. Comput. Sci.
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2023 J jnl
Traversability, Reconfiguration, and Reachability in the Gadget Framework.
Algorithmica
Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022 A* conf
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles.
SoCG
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo
2022 J jnl
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without Flat Angles.
CoRR
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Victor Luo
2022 B conf
Lower Bounds on Retroactive Data Structures.
ISAAC
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022 J jnl
Lower Bounds on Retroactive Data Structures.
CoRR
Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022 J jnl
Orthogonal Fold & Cut.
CoRR
Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan H. Hendrickson, Victor Luo, Rachana Madhukara
2022 C conf
PSPACE-Completeness of Reversible Deterministic Systems.
MCU
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2022 J jnl
PSPACE-Completeness of Reversible Deterministic Systems.
CoRR
Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch
2022 Misc conf
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.
FUN
Joshua Ani, Lily Chung, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022 J jnl
The Legend of Zelda: The Complexity of Mechanics.
CoRR
Jeffrey Bosboom, Josh Brunner, Michael J. Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Elle Najt
2022 B conf
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets.
WALCOM
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2022 B conf
Traversability, Reconfiguration, and Reachability in the Gadget Framework.
WALCOM
Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2022 J jnl
Traversability, Reconfiguration, and Reachability in the Gadget Framework.
CoRR
Joshua Ani, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2021 Misc conf
1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete.
FUN
Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff
2021 A* conf
Characterizing Universal Reconfigurability of Modular Pivoting Robots.
SoCG
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2021 Misc conf
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.
FUN
Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2020 J jnl
1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete.
CoRR
Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff
2020 J jnl
Characterizing Universal Reconfigurability of Modular Pivoting Robots.
CoRR
Hugo A. Akitaya, Erik D. Demaine, Andrei Gonczi, Dylan H. Hendrickson, Adam Hesterberg, Matias Korman, Oliver Korten, Jayson Lynch, Irene Parada, Vera Sacristán
2020 B conf
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard.
ISAAC
Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman
2020 J jnl
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard.
CoRR
Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman
2020 J jnl
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
CoRR
Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang
2020 J jnl
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
J. Inf. Process.
Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang
2020 J jnl
PSPACE-completeness of Pulling Blocks to Reach a Goal.
CoRR
Joshua Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
2020 J jnl
PSPACE-completeness of Pulling Blocks to Reach a Goal.
J. Inf. Process.
Joshua Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl
2020 A conf
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard.
ITCS
Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2020 J jnl
Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets.
CoRR
Joshua Ani, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2020 J jnl
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets.
CoRR
Joshua Ani, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova, Dylan H. Hendrickson, Jayson Lynch
2018 J jnl
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard.
CoRR
Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch