Loopless Gray Code Enumeration and the Tower of Bucharest.

DOI10.4230/LIPIcs.FUN.2016.19zbMath1369.68267arXiv1604.06707OpenAlexW3105854028MaRDI QIDQ5282817

Felix Herter, Günter Rote

Publication date: 17 July 2017

Full work available at URL: https://arxiv.org/abs/1604.06707

zbMATH Keywords

enumerationGray codeloopless generationTower of Hanoi

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial games (91A46) Algorithms on strings (68W32)

Related Items (3)

Loopless Gray code enumeration and the Tower of Bucharest ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ A constant-time algorithm for middle levels Gray codes

This page was built for publication: Loopless Gray Code Enumeration and the Tower of Bucharest.