Towers of Hanoi and Analysis of Algorithms
From MaRDI portal
Recommendations
Cited in
(18)- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
- An iterative algorithm for the Tower of Hanoi with four pegs
- A note on parallelism for the towers of Hanoi
- Parallelism for multipeg towers of Hanoi
- Word calculus in the fundamental group of the Menger curve
- Exponential vs. Subexponential Tower of Hanoi Variants
- Algorithm and time complexity analysis of six-pole Hanoi tower problem
- Computational solution of an old tower of Hanoi problem
- Tours de Hanoï et automates
- scientific article; zbMATH DE number 4007723 (Why is no real title available?)
- scientific article; zbMATH DE number 4011933 (Why is no real title available?)
- Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
- A statistical analysis of the towers of hanoi problem
- scientific article; zbMATH DE number 18900 (Why is no real title available?)
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
- If you are the smartest person in the room, you are in the wrong room
- On a question of Leiss regarding the Hanoi Tower problem
This page was built for publication: Towers of Hanoi and Analysis of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718506)
