Loopless Gray code enumeration and the Tower of Bucharest

DOI10.1016/j.tcs.2017.11.017zbMath1402.68135OpenAlexW2343738579MaRDI QIDQ1623270

Felix Herter, Günter Rote

Publication date: 23 November 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5886/

zbMATH Keywords

enumerationGray codeloopless generationTower of Hanoi

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• On generating all maximal independent sets
• The Towers of Hanoi Problem
• The Tower of Hanoi – Myths and Maths
• Efficient generation of the binary reflected gray code and its applications
• A constant-time algorithm for middle levels Gray codes
• Counting and Enumerating Crossing-free Geometric Graphs
• Purely Functional Data Structures
• The Tower of Hanoi with Forbidden Moves
• Loopless Gray Code Enumeration and the Tower of Bucharest.
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Loopless Gray code enumeration and the Tower of Bucharest