Sarah Eisenstat

28 papers A* 4A 4B 3Journal 14Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard.
CoRR
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2025 J jnl
Who needs crossings?: Noncrossing linkages are universal, and deciding (global) rigidity is hard.
J. Comput. Geom.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2021 J jnl
On the effects of hierarchical self-assembly for reducing program-size complexity.
Theor. Comput. Sci.
Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert Schweller, Scott M. Summers, Andrew Winslow
2018 A conf
Solving the Rubik's Cube Optimally is NP-complete.
STACS
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2017 J jnl
Solving the Rubik's Cube Optimally is NP-complete.
CoRR
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2017 J jnl
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...
J. Inf. Process.
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Adam Hesterberg, Andrea Lincoln, Jayson Lynch, Yun William Yu
2016 A* conf
Who Needs Crossings? Hardness of Plane Graph Rigidity.
SoCG
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2015 J jnl
Free Edge Lengths in Plane Graphs.
Discret. Comput. Geom.
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
2015 A* conf
Learning Regular Languages via Alternating Automata.
IJCAI
Dana Angluin, Sarah Eisenstat, Dana Fisman
2014 A* conf
Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems.
ASPLOS
Yufei Ding, Mingzhou Zhou, Zhijia Zhao, Sarah Eisenstat, Xipeng Shen
2014 A* conf
Free Edge Lengths in Plane Graphs.
SoCG
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth
2013 A conf
Algorithms for Designing Pop-Up Cards.
STACS
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow
2013 J jnl
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.
Inf. Media Technol.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2013 J jnl
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.
J. Inf. Process.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
2013 J jnl
Folding Equilateral Plane graphs.
Int. J. Comput. Geom. Appl.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
2013 J jnl
On the learnability of shuffle ideals.
J. Mach. Learn. Res.
Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich
2013 J jnl
One-dimensional staged self-assembly.
Nat. Comput.
Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow
2013 A conf
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.
STACS
Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow
2013 — conf
Variations on Instant Insanity.
Space-Efficient Data Structures, Streams, and Algorithms
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara
2012 J jnl
Two Hands Are Better Than One (up to constant factors)
CoRR
Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert Schweller, Scott M. Summers, Andrew Winslow
2011 J jnl
Algorithms for Solving Rubik's Cubes
CoRR
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow
2011 A conf
Algorithms for Solving Rubik's Cubes.
ESA
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow
2011 — conf
Expansive Motions for d-Dimensional Open Chains.
CCCG
Sarah Eisenstat, Erik D. Demaine
2011 B conf
Flattening Fixed-Angle Chains Is Strongly NP-Hard.
WADS
Erik D. Demaine, Sarah Eisenstat
2011 B conf
Folding Equilateral Plane Graphs.
ISAAC
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
2011 B conf
One-Dimensional Staged Self-assembly.
DNA
Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow
2011 — conf
Remarks on Separating Words.
DCFS
Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson
2011 J jnl
Remarks on separating words
CoRR
Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson