Della H. Hendrickson
Orcid: 0000-0002-9967-8799Affiliations:
- Massachusetts Institute of Technology, Cambridge, MA, USA
According to our database1,
Della H. Hendrickson
authored at least 25 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude.
CoRR, 2024
Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More.
Proceedings of the Unconventional Computation and Natural Computation, 2024
Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
2023
Algorithmica, November, 2023
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.
Theor. Comput. Sci., August, 2023
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023
2022
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the 37th International Symposium on Computational Geometry, 2021
2020
J. Inf. Process., 2020
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
2018
A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard.
CoRR, 2018