×

Found 79 Documents (Results 1–79)

Loopless Gray code enumeration and the Tower of Bucharest. (English) Zbl 1369.68267

Demaine, Erik D. (ed.) et al., 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-005-7). LIPIcs – Leibniz International Proceedings in Informatics 49, Article 19, 19 p. (2016).
MSC:  68R05 68W32 91A46

Selenite towers move faster than Hanoï towers, but still require exponential time. (English) Zbl 1369.68231

Demaine, Erik D. (ed.) et al., 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-005-7). LIPIcs – Leibniz International Proceedings in Informatics 49, Article 5, 20 p. (2016).
MSC:  68Q25

Which multi-peg Tower of Hanoi problems are exponential? (English) Zbl 1321.68297

Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26–28, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 81-90 (2012).
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software