Expansive Motions for d-Dimensional Open Chains. - Sarah Eisenstat; Erik D. Demaine (CCCG, 2011)

Remarks on Separating Words. - Erik D. Demaine; Sarah Eisenstat; Jeffrey O. Shallit; David A. Wilson (DCFS, 2011)

Algorithms for Solving Rubik's Cubes. - Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Anna Lubiw; Andrew Winslow (ESA, 2011)

Flattening Fixed-Angle Chains Is Strongly NP-Hard. - Erik D. Demaine; Sarah Eisenstat (WADS, 2011)

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)

Variations on Instant Insanity. - Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Thomas D. Morgan; Ryuhei Uehara (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Algorithms for Designing Pop-Up Cards. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Giovanni Viglietta; Andrew Winslow (STACS, 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 (STACS, 2013)

Folding Equilateral Plane graphs. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Jayson Lynch; Tao B. Schardl; Isaac Shapiro-Ellowitz (Int. J. Comput. Geom. Appl., 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 (J. Inf. Process., 2013)

On the learnability of shuffle ideals. - Dana Angluin; James Aspnes; Sarah Eisenstat; Aryeh Kontorovich (J. Mach. Learn. Res., 2013)

One-dimensional staged self-assembly. - Erik D. Demaine; Sarah Eisenstat; Mashhood Ishaque; Andrew Winslow (Nat. Comput., 2013)

Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems. - Yufei Ding 001; Mingzhou Zhou; Zhijia Zhao 001; Sarah Eisenstat; Xipeng Shen (ASPLOS, 2014)

Learning Regular Languages via Alternating Automata. - Dana Angluin; Sarah Eisenstat; Dana Fisman (IJCAI, 2015)

Free Edge Lengths in Plane Graphs. - Zachary Abel; Robert Connelly; Sarah Eisenstat; Radoslav Fulek; Filip Moric; Yoshio Okamoto; Tibor Szabó; Csaba D. Tóth (Discret. Comput. Geom., 2015)

Who Needs Crossings? Hardness of Plane Graph Rigidity. - Zachary Abel; Erik D. Demaine; Martin L. Demaine; Sarah Eisenstat; Jayson Lynch; Tao B. Schardl (SoCG, 2016)

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)

Solving the Rubik's Cube Optimally is NP-complete. - Erik D. Demaine; Sarah Eisenstat; Mikhail Rudoy (STACS, 2018)

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)