Sarah Eisenstat
From MaRDI portal
Person:256714
Available identifiers
zbMath Open eisenstat.sarahMaRDI QIDQ256714
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| On the effects of hierarchical self-assembly for reducing program-size complexity | 2021-11-11 | Paper |
| Solving the Rubik's Cube Optimally is NP-complete | 2020-08-05 | Paper |
| Free Edge Lengths in Plane Graphs | 2018-04-23 | Paper |
| Who Needs Crossings? Hardness of Plane Graph Rigidity | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957882 | 2017-01-30 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| One-dimensional staged self-assembly | 2016-03-10 | Paper |
| FOLDING EQUILATERAL PLANE GRAPHS | 2015-12-22 | Paper |
| Free edge lengths in plane graphs | 2015-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2933851 | 2014-12-08 | Paper |
| Variations on Instant Insanity | 2013-09-13 | Paper |
| Folding equilateral plane graphs | 2011-12-16 | Paper |
| One-dimensional staged self-assembly | 2011-09-16 | Paper |
| Algorithms for solving Rubik's cubes | 2011-09-16 | Paper |
| Flattening fixed-angle chains is strongly NP-hard | 2011-08-12 | Paper |
| Remarks on separating words | 2011-07-29 | Paper |
Research outcomes over time
This page was built for person: Sarah Eisenstat
