Sarah Eisenstat
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
9
Venues
7
Active years
2011–2018
Best venue rank
A*
Where they publish
Papers
9 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2018 | STACS | Solving the Rubik's Cube Optimally is NP-complete. | Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy |
| 2015 | IJCAI | Learning Regular Languages via Alternating Automata. | Dana Angluin, Sarah Eisenstat, Dana Fisman |
| 2014 | ASPLOS | 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 |
| 2013 | STACS | 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 |
| 2013 | STACS | 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 |
| 2011 | DNA | One-Dimensional Staged Self-assembly. | Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow |
| 2011 | ESA | Algorithms for Solving Rubik's Cubes. | Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow |
| 2011 | ISAAC | Folding Equilateral Plane Graphs. | Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz |
| 2011 | WADS | Flattening Fixed-Angle Chains Is Strongly NP-Hard. | Erik D. Demaine, Sarah Eisenstat |