26 citations · 145 across the 47 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 11 cited
Algorithms for Solving Rubik's Cubes
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat +2
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 R…
cs.FL2011★ 6 cited
Remarks on separating words
Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit +1
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…