An analysis of the generalized Towers of Hanoi problem-Reference-Cited by-同舟云学术

An analysis of the generalized Towers of Hanoi problem

Published:1983-12 Issue:4 Volume:23 Page:429-435
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Er M. C.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01933618.pdf

Reference6 articles.

1. P. Buneman and L. Levy,The Towers of Hanoi problem, Information Processing Letters 10 (1980) 243–244.

2. E. W. Dijkstra,A short introduction to the art of programming, EWD316 (1971).

3. M. C. Er,A representation approach to the Tower of Hanoi problem, Computer Journal 25 (1982) 442–447.

4. M. C. Er,The generalized Towers of Hanoi problem, Information Processing Letters (in press).

5. M. C. Er,An iterative solution to the generalized Towers of Hanoi problem, Technical Report, Department of Computing Science, University of Wollongong (1982).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Functional pearl;ACM SIGPLAN Notices;2009-08-31

2. Shortest Paths in the Tower of Hanoi Graph and Finite Automata;SIAM Journal on Discrete Mathematics;2006-01

3. The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi);Mathematics Magazine;1994-12

4. The average distance on the Sierpiński gasket;Probability Theory and Related Fields;1990-03

5. The complexity of an optimal algorithm for the generalized tower of hanoi problem;International Journal of Computer Mathematics;1990-01