#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2009

2017

- This year (2)
- Last 5 years (12)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sarah Cannon, Erik D. Demaine, +5 authors Andrew Winslow
- ArXiv
- 2012

We study the difference between the standard seeded model of tile self-assembly, and the “seedless” two-handed model of tile self-assembly. Most of our results suggest that the two-handed model is… (More)

The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length ≤ n (by accepting one and rejecting the other). In this paper we survey what is… (More)

- Dana Angluin, Sarah Eisenstat, Dana Fisman
- IJCAI
- 2015

Nearly all algorithms for learning an unknown regular language, in particular the popular L∗ algorithm, yield deterministic finite automata. It was recently shown that the ideas of L∗ can be extended… (More)

We prove the NP-completeness of finding a Hamiltonian path in an N ×N ×N cube graph with turns exactly at specified lengths along the path. This result establishes NP-completeness of Snake Cube… (More)

The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also… (More)

- Dana Angluin, James Aspnes, Sarah Eisenstat, Aryeh Kontorovich
- Journal of Machine Learning Research
- 2012

PAC learning of unrestricted regular languages is long known to be a difficult problem. The class of shuffle ideals is a very restricted subclass of regular languages, where the shuffle ideal… (More)

- Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl
- Symposium on Computational Geometry
- 2016

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: “globally noncrossing” graphs, which avoid crossings in all of… (More)

- Sarah Cannon, Erik D. Demaine, +5 authors Andrew Winslow
- STACS
- 2013

1 Mathematical Institute, University of Oxford, 24-29 St. Giles’, Oxford OX1 3LB, UK sarah.cannon@linacre.ox.ac.uk. Research supported in part by National Science Foundation grants CCF-0830734 and… (More)

- Erik D. Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow
- Natural Computing
- 2011

We introduce the problem of staged self-assembly of one-dimensional nanostructures, which becomes interesting when the elements are labeled (e.g., representing functional units that must be placed at… (More)

It has been shown previously that a Maximum Entropy model can be used to learn the correct weights on linguistic constraints in the supervised case [4]. In this paper, we show how to extend the… (More)