Sarah Eisenstat

According to our database, Sarah Eisenstat authored at least 20 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl

CoRR, October, 2025

2021

On the effects of hierarchical self-assembly for reducing program-size complexity.

Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow

Theor. Comput. Sci., 2021

2018

Solving the Rubik's Cube Optimally is NP-complete.

Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...

Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu

J. Inf. Process., 2017

2016

Who Needs Crossings? Hardness of Plane Graph Rigidity.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Learning Regular Languages via Alternating Automata.

Dana Angluin, Sarah Eisenstat, Dana Fisman

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Free Edge Lengths in Plane Graphs.

Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems.

Yufei Ding, Mingzhou Zhou, Zhijia Zhao, Sarah Eisenstat, Xipeng Shen

Proceedings of the Architectural Support for Programming Languages and Operating Systems, 2014

2013

On the learnability of shuffle ideals.

Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich

J. Mach. Learn. Res., 2013

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl

Inf. Media Technol., 2013

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.

Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Algorithms for Designing Pop-Up Cards.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Variations on Instant Insanity.

Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara

Proceedings of the Space-Efficient Data Structures, 2013

2012

Two Hands Are Better Than One (up to constant factors)

Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow

CoRR, 2012

2011

Flattening Fixed-Angle Chains Is Strongly NP-Hard.

Erik D. Demaine, Sarah Eisenstat

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Folding Equilateral Plane Graphs.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Algorithms for Solving Rubik's Cubes.

Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow

Proceedings of the Algorithms - ESA 2011, 2011

One-Dimensional Staged Self-assembly.

Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow

Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

Remarks on Separating Words.

Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson

Proceedings of the Descriptional Complexity of Formal Systems, 2011

Expansive Motions for d-Dimensional Open Chains.

Sarah Eisenstat, Erik D. Demaine

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011