Jenny Diomidova

Affiliations:

Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge, MA, USA

According to our database¹, Jenny Diomidova authored at least 20 papers between 2020 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Undecidability of Tiling with a Tromino.

[BibT_eX]

[DOI]

CoRR, September, 2025

Pushing Blocks without Fixed Blocks via Checkable Gizmos: Push-1 is PSPACE-Complete.

[BibT_eX]

[DOI]

CoRR, August, 2025

Hardness of Traversing Gadget Systems with Small Bandwidth.

[BibT_eX]

[DOI]

Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks, 2025

2024

Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude.

[BibT_eX]

[DOI]

CoRR, 2024

All Polyhedral Manifolds are Connected by a 2-Step Refolding.

[BibT_eX]

[DOI]

CoRR, 2024

Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2024

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints.

[BibT_eX]

[DOI]

MIT-NASA Space Robots Team

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

Any platonic solid can transform to another by <i>O</i>(1) refoldings.

[BibT_eX]

[DOI]

Comput. Geom., August, 2023

This Game Is Not Going To Analyze Itself.

[BibT_eX]

[DOI]

CoRR, 2023

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on DNA Computing and Molecular Programming, 2023

2022

Traversability, Reconfiguration, and Reachability in the Gadget Framework.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

This Game Is Not Going To Analyze Itself.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2022

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Strings-and-Coins and Nimstring are PSPACE-complete.

[BibT_eX]

[DOI]

Erik D. Demaine

Jenny Diomidova

CoRR, 2021

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

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

PSPACE-completeness of Pulling Blocks to Reach a Goal.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

New Results in Sona Drawing: Hardness and TSP Separation.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Jenny Diomidova

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...