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 Theoretical Computer Science | 2021-11-11 | Paper |
| Solving the Rubik's Cube Optimally is NP-complete (available as arXiv preprint) | 2020-08-05 | Paper |
| Free edge lengths in plane graphs Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Who needs crossings? Hardness of plane graph rigidity | 2018-01-30 | Paper |
| Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM (available as arXiv preprint) | 2017-01-30 | Paper |
| Algorithms for designing pop-up cards | 2017-01-30 | Paper |
| One-dimensional staged self-assembly Natural Computing | 2016-03-10 | Paper |
| Folding equilateral plane graphs International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
| Free edge lengths in plane graphs Discrete & Computational Geometry | 2015-07-20 | Paper |
| On the learnability of shuffle ideals | 2014-12-08 | Paper |
| Variations on instant insanity Lecture Notes in Computer Science | 2013-09-13 | Paper |
| Folding equilateral plane graphs Algorithms and Computation | 2011-12-16 | Paper |
| One-dimensional staged self-assembly Lecture Notes in Computer Science | 2011-09-16 | Paper |
| Algorithms for solving Rubik's cubes Algorithms – ESA 2011 | 2011-09-16 | Paper |
| Flattening fixed-angle chains is strongly NP-hard Lecture Notes in Computer Science | 2011-08-12 | Paper |
| Remarks on separating words Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
Research outcomes over time
This page was built for person: Sarah Eisenstat
