The following pages link to The Towers of Hanoi Problem (Q1142217):
Displaying 35 items.
- On the discretization in time for a parabolic integrodifferential equation with a weakly singular kernel. I: Smooth initial data (Q687200) (← links)
- A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle (Q791323) (← links)
- On a question of Leiss regarding the Hanoi Tower problem (Q861280) (← links)
- An optimal algorithm to implement the Hanoi towers with parallel moves (Q1007629) (← links)
- An iterative solution to the generalized Towers of Hanoi problem (Q1050779) (← links)
- An analysis of the generalized Towers of Hanoi problem (Q1056547) (← links)
- Towers of Hanoi problems: deriving iterative solutions by program transformations (Q1067772) (← links)
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem (Q1071509) (← links)
- Derivation of efficient programs for computing sequences of actions (Q1093362) (← links)
- A general algorithm for finding a shortest path between two n- configurations (Q1098292) (← links)
- A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc (Q1116691) (← links)
- The cyclic towers of Hanoi (Q1155964) (← links)
- The towers of Hanoi revisited: Moving the rings by counting the moves (Q1165783) (← links)
- The towers of Hanoi problem with parallel moves (Q1209348) (← links)
- The towers of Hanoi problem with cyclic parallel moves (Q1210308) (← links)
- The generalized Towers of Hanoi for space-deficient computers and forgetful humans (Q1272420) (← links)
- Recursive information transducers: Computation models (Q1288659) (← links)
- A note on parallelism for the towers of Hanoi (Q1336867) (← links)
- The associativity of equivalence and the Towers of Hanoi problem (Q1607084) (← links)
- Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) (← links)
- Parallelism for multipeg towers of Hanoi (Q1804221) (← links)
- Iteration strikes back - at the cyclic Towers of Hanoi (Q1838033) (← links)
- An iterative algorithm for the cyclic Towers of Hanoi problem (Q3219130) (← links)
- A generalization of the cyclic towers of hanoi: an iterative solution (Q3319783) (← links)
- The Generalized Towers of Hanoi Problem (Q3330527) (← links)
- The Colour Towers of Hanoi – An Iterative Solution (Q3330528) (← links)
- The multiway trees of hanoi<sup>†</sup> (Q3335009) (← links)
- Tours de Hanoï et automates (Q3479519) (← links)
- Pour en finir avec la dérécursivation du problème des tours de Hanoï (Q3479520) (← links)
- The Towers of Hanoi and Binary Numerals (Q3700851) (← links)
- The Cyclic Towers of Hanoi and Pseudo Ternary Codes (Q3742739) (← links)
- A loopless approach for constructing a fastest algorithm for the towers of hanoi problem (Q3802653) (← links)
- A statistical analysis of the towers of hanoi problem (Q3815308) (← links)
- A loopless approach to the multipeg towers of hanoi (Q4009743) (← links)
- A Minimal Space Algorithm for Solving the Towers of Hanoi Problem (Q5751947) (← links)