The Tower of Hanoi: A Histori

al
Survey and Bibliography
Paul K. Sto kmeyer
Department of Computer S ien e
College of William and Mary

sto kmeyer s.wm.edu

Version 0.2
September 16, 1997
Corre ted O tober 10, 2001

This is the nal se tion of a planned histori al survey of all information of a

mathemati al nature that has been published about the Tower of Hanoi puzzle. This
bibliography ontains itations to all mathemati al journal arti les on the subje t
known to the author, as well as itations to books that provide signi ant treatment
of variations and extensions of the basi puzzle. Arti les in psy hologi al journals
that dis uss uses of the puzzle in testing of subje ts are not in luded, nor are textbooks in dis rete mathemati s that provide routine presentations of standard basi
information. Readers are en ouraged to send omments, orre tions, and additions
to the author.
The notation MR in a itation, when present, is followed by the orresponding
review itation in Mathemati al Reviews. Full des riptions of the journals ited an
be found in the journal index at the end of the bibliography.

Bibliography
[1 Ruth A a k, Tower of Hanoi, Austral. Math. Tea her 48 (1992), no. 1, 2.
[2 S. N. Afriat, The ring of linked rings, Du kworth, London, 1982.
[3 W. Ahrens, Mathematis he Unterhaltungen und Spiele, B. G. Teubner, Leipzig,
1901. Se ond edition, in two volumes, 1910 and 1918; Third edition of volume
I, 1921.

Paul K. Sto kmeyer

B.

[4 R. E. Allardi e and A. Y. Fraser, La tour d'Hano, Pro eedings of the Edinburgh

Mathemati al So iety 2 (1884), 50{53.
[5 Jean-Paul Allou he, Tours de Hanoi et automates nis, Groupe de travail en
theorie analytique et elementaire des nombres, 1986{1987, Publ. Math. Orsay,
vol. 88, Univ. Paris XI, Orsay, 1988, pp. 1{3.
[6 Jean-Paul Allou he, Note on the y li towers of Hanoi, Theoret. Comput. S i.
123 (1994), 3{7. MR 94k:05019.
[7 Jean-Paul Allou he, Dan Astoorian, Jim Randall, and Jerey [O. Shallit, Morphisms, squarefree strings, and the tower of Hanoi puzzle, Amer. Math. Monthly
101 (1994), 651{658. MR 95g:68090.
[8 Jean-Paul Allou he and Roland Ba her, Toeplitz sequen es, paperfolding, towers
of Hanoi and progression-free sequen es of integrs, Enseign. Math. (2) 38 (1992),
315{327. MR 93j:11017.
[9 J[ean-P[aul Allou he, J. Betrema, and J[erey O. Shallit, Sur des points xes
de morphismes d'un monode libre, RAIRO Inform. Theor. Appl. 23 (1989),
135{249. MR 91a:68154.
[10 J[ean-P[aul Allou he and F. Dress, Tours de Hano et automates, RAIRO
Inform. Theor. Appl. 24 (1990), 1{15. MR 91g:68060.
[11 Oliver D. Anderson, Indu tion, re ursion, and the towers of Hanoi, Internat. J.
Math. Ed. S i. Te h. 23 (1992), no. 3, 339{343.
Dan Astoorian, see [7.
[12 M. D. Atkinson, The y li towers of Hanoi, Inform. Pro ess. Lett. 13 (1981),
no. 3, 118{119. MR 83f:68004.
Roland Ba her, see [8.
[13 R. M. Baer, A biologi al model solution to the towers of Hanoi problem, Comput.
J. 29 (1986), no. 4, 382{382.
R.-A. Bakhtiar, see [102.
[14 W. W. Rouse Ball, Mathemati al Re reations and Problems of Past and Present
Times, Ma millan and Co., London, 1892. Fourth (1905) and later editions
published under the title Mathemati al Re reations and Essays. Eleventh (1939)
and later editions o-authored with H. S. M. Coxeter.
C. Douglass Bateman, see [195.

Paul K. Sto kmeyer

B.

[15 J. Bendis h, Generalized sequen ing problem \Towers of Hanoi", Z. Oper. Res.
Ser. A 29 (1985), no. 1 (Mar h), 31{45. MR 86f:90098.
J. Betrema, see [9.
[16 Graham Birtwistle, The oroutines of Hanoi, SIGPLAN Noti es 20 (1985), no. 1
(January), 9{10.
Somenath Biswas, see [106.
[17 J. T. Boardman, C. Garrett, and G. C. A. Robson, A re ursive algorithm for the

optimal solution of a omplex allo ation problem using a dynami programming

formulation, Comput. J. 29 (1986), no. 2, 182{186.

[18 J. T. Boardman and G. C. A. Robson, Towards a problem-solving methodology

for oping with in reasing omplexity: an engineering approa h, Comput. J. 29
(1986), no. 2, 161{166.
[19 Al Bor hers and Prosenjit Gupta, Extending the quadrangle inequality to speedup dynami programming, Inform. Pro ess. Lett. 49 (1994), no. 6, 287{290.
[20 Brother Alfred Brousseau, Tower of Hanoi with more pegs, J. Re reational
Math. 8 (1975-1976), no. 3, 169{176. Reprinted in Mathemati al Solitaires &
Games, Benjamin L. S hwartz, ed., Baywood Publishing Co., In ., Farmingdale,
NY, 1980, pp. 29{36.
[21 P[eter Buneman and L[eon S. Levy, Gray ode gleanings, Pro eedings of the
1978 Conferen e on Information S ien es and Systems, Johns Hopkins University, 1978, pp. 199{202.
[22 Peter Buneman and Leon [S. Levy, The towers of Hanoi problem, Inform.
Pro ess. Lett. 10 (1980), no. 4-5, 243{244. MR 81j:68043.
[23 John Cardoso, Revisiting the towers of Hanoi, AI Expert 6 (1991), no. 10 (O tober), 48{53.
[24 Joe Celko, Mutants of Hanoi, ABACUS 1 (1984), no. 3 (Spring), 54{57.
P. P. Chakrabarti, see [85.
[25 Tat-Hung Chan, A statisti al analysis of the towers of Hanoi problem, Internat.
J. Comput. Math. 28 (1989), 57{65.
[26 Fouad B. Chedid and Toshiya Mogi, A simple iterative algorithm for the towers
of Hanoi problem, IEEE Trans. Ed. 39 (May 1996), no. 2, 274{275.
Rong-Jaye Chen, see [203 and [204.

Paul K. Sto kmeyer

B.

[27 I-Ping Chu and Ri hard Johnsonbaugh, The four-peg tower of hanoi puzzle,
SIGCSE Bull. 23 (1991), no. 3, 2{4.
James W. Clark, see [195.
[28 N. Claus, La tour d'Hano: Veritable asse-t^ete Annamite, 1883. Flyer printed
by Paul Bousrez, Tours.
[29 N. Claus, La tour d'Hano: Jeu de Cal ul, S ien e et Nature 1 (1884), no. 8
(January 19), 127{128.
M. Clint, see [78.
H. S. M. Coxeter, see [14.
[30 D. W. Crowe, The n-dimensional ube and the tower of Hanoi, Amer. Math.
Monthly 63 (1956), 29{30. MR 17:655h.
[31 Paul Cull and E. F. E klund, Jr., On the towers of Hanoi and generalized towers
of Hanoi problems, Congr. Numer. 35 (1982), 229{238. (Pro eedings of the 13th
Southeastern Conferen e on Combinatori s, Graph Theory and Computing.)
MR 85a:68059.
[32 Paul Cull and E. F. E klund, Jr., Towers of Hanoi and analysis of algorithms,
Amer. Math. Monthly 92 (1985), 407{420. MR 87a:68069.
[33 Paul Cull and Colin Gerety, Is towers of Hanoi really hard?, Congr. Numer. 47
(1985), 237{242. (Pro eedings of the 16th Southeastern International Conferen e
on Combinatori s, Graph Theory and Computing.)
Paul Cull, see also [82.
[34 A. K. Dewdney, Computer Re reations: Yin and yang: re ursion and iteration, the Tower of Hanoi and the Chinese rings, S i. Amer. 251 (1984), no. 5
(November), 19{28. Reprinted, with Addendum, in The Arm hair Universe:
An Exploration of Computer Worlds, W. H. Freeman and Co., New York, 1988,
pp. 186{199.
[35 Leroy J. Di key, Grey odes, towers of Hanoi, Hamiltonian paths on the N - ube,
and Chinese rings, APL Quote Quad 24 (1993), no. 2 (De ember), 18{24.
T. S. Dillon, see [120, [121, and [122.
F. Dress, see [10.
[36 Vladimir Dubrovsky, Nesting puzzles, Part I: Moving oriental towers, Quantum
6 (1996), no. 3 (January/Febrary), 53{57, 49{51.

Paul K. Sto kmeyer

B.

[37 Vladimir Dubrovsky, Nesting puzzles, Part II: Chinese rings produ e a Chinese
monster, Quantum 6 (1996), no. 4 (Mar h/April), 61{65, 58{59.
[38 Henry Ernest Dudeney, The Canterbury Puzzles (and other urious problems),
Thomas Nelson and Sons, Ltd., London, 1907.
[39 Otto Dunkel, Editorial note on erning advan ed problem 3918, Amer. Math.
Monthly 48 (1941), 219.
E. F. E klund, Jr., see [31 and [32.
[40 Blei ke Eggers, The towers of Hanoi: Yet another nonre ursive solution, SIGPLAN Noti es 20 (1985), no. 9 (September), 32{42.
[41 M. C. Er, A representation approa h to the tower of Hanoi problem, Comput.
J. 25 (1982), no. 4, 442{447.
[42 M. C. Er, An iterative solution to the generalized towers of Hanoi problem, BIT
23 (1983), 295{302. MR 84g:68019.
[43 M. C. Er, An analysis of the generalized towers of Hanoi problem, BIT 23
(1983), 429{435. MR 85a:68060.
[44 M. C. Er, The y li towers of Hanoi, Egypt. Comput. J. 11 (1983), 91{99.
[45 M. C. Er, The olour towers of Hanoi: A generalization, Comput. J. 27 (1984),
no. 1, 80{82.
[46 M. C. Er, The y li towers of Hanoi: A representation approa h, Comput. J.
27 (1984), no. 2, 171{175.
[47 M. C. Er, The generalized olour towers of Hanoi: An iterative algorithm, Comput. J. 27 (1984), no. 3, 278{282. MR 86 :68030.
[48 M. C. Er, The tower of Hanoi as a trivial problem|a reply, Comput. J. 27
(1984), no. 3, 285.
[49 M. C. Er, A generalization of the y li towers of Hanoi: An iterative solution,
Internat. J. Comput. Math. 15 (1984), 129{140. MR 86a:68031.
[50 M. C. Er, On the omplexity of re ursion in problem-solving, Internat. J. ManMa hine Studies 20 (1984), 537{544.
[51 M. C. Er, An iterative algorithm for the y le towers of Hanoi problem, Internat.
J. Comput. Inform. S i. 13 (1984), no. 2, 123{129. MR 86 :68029.
[52 M. C. Er, The generalized towers of Hanoi problem, J. Inform. Optim. S i. 5
(1984), no. 1, 89{94.

Paul K. Sto kmeyer

B.

[53 M. C. Er, The olour towers of Hanoi|An iterative solution, J. Inform. Optim.
S i. 5 (1984), no. 2, 95{104.
[54 M. C. Er, The tower of Hanoi problem|a further reply, Comput. J. 28 (1985),
no. 5, 543{544.
[55 M. C. Er, The omplexity of the generalized y li towers of Hanoi problem, J.
Algorithms 6 (1985), 351{358. MR 86k:68035.
[56 M. C. Er, Towers of Hanoi with bla k and white dis s, J. Inform. Optim. S i. 6
(1985), no. 1, 87{94. MR 86k:68036.
[57 M. C. Er, The towers of Hanoi and binary numerals, J. Inform. Optim. S i. 6
(1985), no. 2, 147{152. MR 86m:68058.
[58 M. C. Er, Performan e evaluations of re ursive and iterative algorithms for the
towers of Hanoi problem, Computing 37 (1986), 93{102. MR 87j:68051.
[59 M. C. Er, A loopless approa h for onstru ting a fastest algorithm for the towers
of Hanoi problem, Internat. J. Comput. Math. 20 (1986), 49{54.
[60 M. C. Er, The y li towers of Hanoi and pseudo ternary odes, J. Inform.
Optim. S i. 7 (1986), no. 3, 271{277.
[61 M. C. Er, A time and spa e e ient algorithm for the y li towers of Hanoi
problem, J. Inform. Pro ess. 9 (1986), no. 3, 163{165.
[62 M. C. Er, A general algorithm for nding a shortest path between two n ongurations, Inform. S i. 42 (1987), 137{141.
[63 M. C. Er, A loopless and optimal algorithm for the y li towers of Hanoi
problem, Inform. S i. 42 (1987), 283{287.
[64 M. C. Er, Counter examples to adjudi ating a towers of Hanoi ontest, Internat.
J. Comput. Math. 21 (1987), 123{131.
[65 M. C. Er, An algorithmi solution to the multi-tower of Hanoi problem, J. Inform. Optim. S i. 8 (1987), no. 1, 91{100.
[66 M. C. Er, An optimal algorithm for Reve's puzzle, Inform. S i. 45 (1988), 39{49.
[67 M. C. Er, A minimal spa e algorithm for solving the towers of Hanoi problem,
J. Inform. Optim. S i. 9 (1988), 183{191. MR 90g:68107.
[68 M. C. Er, A linear spa e algorithm for solving the towers of Hanoi problem by
using a virtual dis , Inform. S i. 47 (1989), 47{52. MR 89k:68064.

Paul K. Sto kmeyer

B.

[69 M. C. Er, A note on the optimality of a Reve algorithm, Comput. J. 34 (1991),

no. 6, 513.
Cyrus R. Eyster, see [195.
[70 Peter Fellgett, Letter to the editor, Comput. J. 27 (1984), no. 4, 378{379.
[71 Peter J. Floriani, Letter to the editor, SIGPLAN Noti es 19 (1984), no. 12
(De ember), 7{10.
[72 J.-C. Fournier, Pour en nir ave la d'ere ursivation du probleme des Tours de
Hano, RAIRO Inform. Theor. Appl. 24 (1990), 17{35.
[73 J. S. Frame, Solution to advan ed problem 3918, Amer. Math. Monthly 48
(1941), 216{217.
[74 Wm. Randolph Franklin, A simpler iterative solution to the towers of Hanoi
problem, SIGPLAN Noti es 19 (1984), no. 8 (August), 87{88.
A. Y. Fraser, see [4.
[75 Martin Gardner, Mathemati al Games: About the remarkable similarity between
the i osian game and the tower of Hanoi, S i. Amer. 196 (1957), no. 5 (May),
150{156. Reprinted, with Addendum, as Chapter 6 of The S ienti Ameri an
Book of Mathemati al Puzzles & Diversions, Simon and S huster, New York,
1959.
[76 Martin Gardner, Mathemati al Games: The urious properties of the Gray ode
and how it an be used to solve puzzles, S i. Amer. 227 (1972), no. 2 (August),
106{109. Reprinted, with Answer, Addendum, and Bibliography, as Chapter 2
of Knotted Doughnuts and Other Mathemati al Entertainments, W. H. Freeman
and Co., New York, 1986.
[77 Martin Gardner, Afterword, 1988, in Hexa exagons and other Mathemati al
Diversions, University of Chi ago Press, 1988. This book is a reprint, with
Afterword and new Bibliography, of the book referred to in [75 above.
C. Garrett, see [17.
[78 D. Gault and M. Clint, A fast algorithm for the towers of Hanoi problem, Comput. J. 30 (1987), no. 4, 376{378.
[79 Thomas D. Gedeon, Guided tour to the towers of Hanoi, SIGPLAN Noti es 21
(1986), 11{12.
[80 T[homas D. Gedeon, The Reve's puzzle: An iterative solution produ ed by
transformation, Comput. J. 35 (1992), no. 2, 186{187.

Paul K. Sto kmeyer

B.

[81 T[homas D. Gedeon, The y li towers of Hanoi: An iterative solution produ ed

by transformation, Comput. J. 39 (1996), no. 4, 353{356.
Thomas D. Gedeon, see also [175 and [176.
[82 Colin Gerety and Paul Cull, Time omplexity of the towers of Hanoi problem,
SIGACT News 18 (1986), 80{88.
Colin Gerety, see also [33.
[83 Italo Ghersi, Mathemati a Dilettevole e Curiosa, Ulri o Hoepli, Milan, 1913.
S. Ghose, see [85.
[84 Ronald L. Graham, Donald E. Kunth, and Oren Patashnik, Con rete mathemati s: A foundation for omputer s ien e, Addison-Wesley, Reading, MA,
1989.
P. M. Grundy, see [184.
[85 P. Gupta, P. P. Chakrabarti, and S. Ghose, The towers of Hanoi: Generalizations, spe ializations, and algorithms, Internat. J. Comput. Math. 46 (1992),
149{161.
Prosenjit Gupta, see [19.
A. Halder, see [142.
Matthew T. Harrison, see [195.
[86 P. J. Hayes, Note on the towers of Hanoi problem, Comput. J. 20 (1977), no. 3,
282{285.
[87 R. J. Heard, The tower of Hanoi as a trivial problem, Comput. J. 27 (1984),
90.
[88 R. J. Heard, Further remarks on the trivial nature of the tower of Hanoi problem,
Comput. J. 28 (1985), no. 5, 543.
[89 R. J. Heard, The tower of Hanoi|again, Comput. J. 29 (1986), no. 4, 381.
[90 Hermann Hering, Zur Mathematisierung des \Turm von Hano"-Spiels, MNU
26 (1973), 408{411.
[91 Hermann Hering, Minimalstrategien in endli hen Systemen, MU 23 (1977),
no. 4, 19{35.

Paul K. Sto kmeyer

B.

[92 H[ermann Hering, Varianten zum \Turm von Hanoi-spiel" { ein Weg zu einfa hen Funktionalglei hungen, MU 25 (1979), no. 2, 82{92.
[93 A[ndreas M. Hinz, An iterative algorithm for the tower of Hanoi with four pegs,
Computing 42 (1989), 133{140. MR 91b:05025.
[94 Andreas M. Hinz, The tower of Hanoi, Enseign. Math. (2) 35 (1989), 289{321.
MR 91k:05015.
[95 Andreas M. Hinz, Pas al's triangle and the tower of Hanoi, Amer. Math.
Monthly 99 (1992), 538{544. MR 93f:05004.
[96 Andreas M. Hinz, Shortest paths between regular states on the tower of Hanoi,
Inform. S i. 63 (1992), 173{181. MR 93b:05001.
[97 Andreas M. Hinz, Square-free tower of Hanoi sequen es, Enseign. Math. (2) 42
(1996), 257{264.
[98 Andreas M. Hinz and Andreas S hief, The average distan e on the Sierpinski
gasket, Probab. Theory Relat. Fields 87 (1990), 129{138. MR 92b:58129.
Yuji Hirayama, see [159 and [160.
[99 Thomas F. Hudson, Jr., Letter to the editor, SIGPLAN Noti es 19 (1984), no. 8
(August), 18{20.
Ri hard Johnsonbaugh, see [27.
[100 Helmut Jurgensen and Deri k Wood, The multiway trees of Hanoi, Internat. J.
Comput. Math. 14 (1983), 137{153. MR 84k:68026.
[101 Mohammad Kaykobad, Towers of Hanoi with 4 pegs, J. Bangladesh A ad. S i.
13 (1989), no. 1, 85{90.
[102 M[ohammad Kaykobad, S. T.-U. Rahman, R.-A. Bakhtiar, and A. A. K. Majumdar, A re ursive algorithm for the multi-peg tower of Hanoi problem, Internat. J. Comput. Math. 57 (1995), 67{73.
M[ohammad Kaykobad, see also [143.
[103 Sandi Klavzar and Uros Milutinovi , Graphs S (n; k) and a variant of the tower
of Hanoi problem, Cze h. Math. J. 47 (1997), no. 122, 95{104.
[104 Carole S. Klein and Steven Minsker, The super towers of Hanoi problem: large
rings on small rings, Dis rete Math. 114 (1993), 283{295. MR 94e:05032.
Donald E. Knuth, see [84.

Paul K. Sto kmeyer

B.

10

[105 Milos Konopasek, The towers of Hanoi from a dierent viewpoint, SIGPLAN
Noti es 20 (1985), no. 12 (De ember), 39{46.
[106 M. S. Krishnamoorthy and Somenath Biswas, The generalized towers of Hanoi,
SIGACT News 10 (Winter 1979), 49.
[107 Ivan Lavalle[e, Note sur le probleme des tours de Hano, A ta Math. Vietnam.
7 (1982), no. 2, 131{137. MR 86b:68018.
[108 Ivan Lavallee, Note sur le probleme des Tours de Hano, Rev. Roumaine Math.
Pures Appl. 30 (1985), 433{438. MR 86k:05012.
[109 Ernst [L. Leiss, Solving the \Towers of Hanoi" on graphs, J. Combin. Inform.
System S i. 8 (1983), no. 1, 81{89. MR 86i:05071.
[110 Ernst L. Leiss, On restri ted Hanoi problems, J. Combin. Inform. System S i.
8 (1983), no. 4, 277{285. MR 86i:05072.
[111 Ernst L. Leiss, Finite Hanoi problems: how many dis s an be handled?, Congr.
Numer. 44 (1984), 221{229. (Pro eedings of the 15th Southeastern Conferen e
of Combinatori s, Graph Theory and Computing.) MR 87b:05062.
Leon S. Levy, see [21 and [22.
[112 Appie van de Liefvoort, An iterative solution to the four-peg tower of Hanoi
problem, Pro eedings of the 18th Annual ACM Computer S ien e Conferen e,
1990, pp. 70{75.
[113 A[ppie van de Liefvoort, An iterative algorithm for the Reve's puzzle, Comput.
J. 35 (1992), no. 1, 91{92.
[114 Norman F. Lindquist, Solution to problem 1350, Math. Mag. 64 (1991), 200.
Ni holas A. Loehr, see [195.
[115 G. de Long hamps, Varietes, Journal de Mathematiques Spe iales (2e serie) 2
(1883), 286{287.
[116 Xue-Miao Lu, Towers of Hanoi graphs, Internat. J. Comput. Math. 19 (1986),
23{38.
[117 Xue-Miao Lu, Towers of Hanoi problem with arbitrary
Comput. Math. 24 (1988), 39{54.

 3 pegs, Internat. J.

[118 Xue-Miao Lu, An iterative solution for the 4-peg towers of Hanoi, Comput. J.
32 (1989), no. 2, 187{189.

Paul K. Sto kmeyer

B.

11

[119 Xue-Miao Lu, A loopless approa h to the multipeg towers of Hanoi, Internat. J.
Comput. Math. 33 (1990), 13{29.
[120 X[ue-M[iao Lu and T. S. Dillon, A note on parallelism for the towers of Hanoi,
Math. Comput. Modelling 20 (1994), no. 3, 1{6. MR 95h:68075.
[121 X[ue-M[iao Lu and T. S. Dillon, Parallelism for mutipeg towers of Hanoi,
Math. Comput. Modelling 21 (1995), no. 3, 3{17. MR 96 :68078.
[122 X[ue-M[iao Lu and T. S. Dillon, Nonre ursive solution to parallel multipeg towers of Hanoi: A de omposition approa h, Math. Comput. Modelling 24 (1996),
no. 3, 29{35. MR 97d:05025.

[123 Edouard
Lu as, Le al ul et les ma hines a al uler, Revue S ientique (3e serie)
8 (1884), no. 16 (O tober 18), 482{496. An abridged version of [124 below.

[124 Edouard
Lu as, Le al ul et les ma hines a al uler, Compte Rendu de la 13e
Session, Asso iation Fran aise pour l'Avan ement des S ien es, 1885, pp. 111{
141. An address presented 8 September 1884 at the Congres de l'Asso iation
held in Blois.


[125 Edouard
Lu as, Nouveaux jeux s ientiques de M. Edouard
Lu as, La Nature,
th
ed
17 year, 2 semester (1889), no. 855 (O tober 5), 301{303.

[126 Edouard
Lu as, Re reations Mathematiques, vol. 3, Gauthier-Villars, Paris,
1893. Reprinted several times by Albert Blan hard, Paris.

[127 Edouard
Lu as, L'Arithmetique Amusante: Introdu tion aux Re reations Mathematiques, Gauthier-Villars, Paris, 1895. Reprinted several times by Albert
Blan hard, Paris.
[128 George F. Luger, The use of the state spa e to re ord the behavioral ee ts
of subproblems and symmetries in the Tower of Hanoi problem, Internat. J.
Man-Ma hine Studies 8 (1976), 411{421.
[129 George F. Luger, A state-spa e des ription of transfer ee ts in isomorphi
problem situations, Internat. J. Man-Ma hine Studies 10 (1978), 613{623.
[130 George F. Luger and Mi hael Steen, Using the state spa e to re ord the behavioral ee ts of symmetry in the tower of Hanoi problem and an isomorph,
Internat. J. Man-Ma hine Studies 14 (1981), 449{460.
[131 W. F. Lunnon, The Reve's puzzle, Comput. J. 29 (1986), 478.
[132 A. A. K. Majumdar, On the generalized tower of Hanoi problem, J. Bangladesh
A ad. S i. 15 (1991), no. 2, 173{183.

Paul K. Sto kmeyer

B.

12

[133 A. A. K. Majumdar, A note on the iterative algorithm for the Reve's puzzle,
Comput. J. 37 (1994), no. 5, 463{464.
[134 A. A. K. Majumdar, Frame's onje ture and the tower of Hanoi problem with
four pegs, Indian J. Math. 36 (1994), no. 3, 215{227. MR 96d:90112.
[135 A. A. K. Majumdar, A note on the iterative algorithm for the four-peg tower of
Hanoi problem, J. Bangladesh A ad. S i. 18 (1994), no. 2, 241{250.
[136 A. A. K. Majumdar, The generalized four-peg tower of Hanoi problem, Optimization 29 (1994), 349{360. MR 95b:90151.
[137 A. A. K. Majumdar, A re ursive algorithm for the 4-peg tower of Hanoi problem,
J. Bangladesh A ad. S i. 19 (1995), no. 1, 123{126.
[138 A. A. K. Majumdar, The generalized p-peg tower of Hanoi problem, Optimization 32 (1995), 175{183. MR 95j:90087.
[139 A. A. K. Majumdar, The divide-and- onquer approa h to the generalized p-peg
tower of Hanoi problem, Optimization 34 (1995), 373{378.
[140 A. A. K. Majumdar, Generalized multi-peg tower of Hanoi problem, J. Austral.
Math. So . Ser. B 38 (1996), no. 2, 201{208. MR 97h:05018.
[141 A. A. K. Majumdar, A note on the steps minimizing fun tion of general Hanoim-tower, J. Bangladesh A ad. S i. 20 (1996), no. 1, 1{7.
[142 A. A. K. Majumdar and A. Halder, A re ursive algorithm for the bottlene k
Reve's puzzle, Surikaisekikenkyusho Kokyuroku (1996), no. 947, 150{161.
[143 A. A. K. Majumdar and M. Kaykobad, An iterative algorithm for the 5-peg
tower of Hanoi problem, J. Bangladesh A ad. S i. 20 (1996), no. 2, 119{128.
[144 Abdulla-Al-Ka Majumdar, The bottlene k tower of Hanoi problem with four
pegs, Pro . Pakistan A ad. S i. 33 (1996), no. 1-2, 127{128.
[145 Abdulla-Al-Ka Majumdar, A note on the generalized multi-peg toer of Hanoi
problem, Pro . Pakistan A ad. S i. 33 (1996), no. 1-2, 129{130.
[146 Abdulla-Al-Ka Majumdar, A note on the y li towers of Hanoi, Pro . Pakistan A ad. S i. 33 (1996), no. 1-2, 131{132.
A[bdulla-A[l-K[a Majumdar, see also [102, [170, and [171.
[147 Sergio Margarita, The towers of Hanoi: a new approa h, AI Expert 8 (1993),
no. 3 (Mar h), 22{27.

Paul K. Sto kmeyer

B.

13

[148 Stephen B. Maurer and Anthony Ralston, Dis rete algorithmi mathemati s,
Addison-Wesley, Reading, MA, 1991.
[149 Herbert Mayer and Don Perkins, Towers of Hanoi revisited: A nonre ursive
surprise, SIGPLAN Noti es 19 (1984), no. 2 (February), 80{84.
[150 Stepan Maziar, Solution of the tower of Hanoi problem using a binary tree,
SIGPLAN Noti es 20 (1985), no. 5 (May), 16{20.
[151 A. J. M intosh, Binary and the towers of Hanoi, Math. Tea hing (Summer
1972), no. 59, 15.
[152 Bertrand Meyer, A note on iterative Hanoi, SIGPLAN Noti es 19 (1984), no. 12
(De ember), 38{40.
Uros Milutinovi , see [103.
[153 Steven Minsker, The towers of Hanoi rainbow problem: Coloring the rings, J.
Algorithms 10 (1989), 1{19. MR 90i:05012.
[154 Steven Minsker, The towers of Antwerpen problem, Inform. Pro ess. Lett. 38
(1991), 107{111. MR 92d:68065.
Steven Minsker, see also [104.
Toshiya Mogi, see [26.
[155 Sheldon S. Myers, Appli ations: An indu tive-dedu tive experiment with the
tower of Hanoi puzzle, Math. Tea her 44 (1951), no. 7 (November), 505.
[156 Sheldon S. Myers, Appli ations: An appli ation of mathemati al indu tion to
the tower of Hanoi, Math. Tea her 45 (1952), no. 7 (November), 522{523.
[157 Robert Neale, The temple of Hanoi{an old puzzler with a new twist, Games 6
(1982), no. 7 (November), 70.
[158 Hugh Noland, Problem 1350, Math. Mag. 63 (1990), 189.
[159 Shigeru Obara and Yuji Hirayama, The \Red and white towers of Hanoi" puzzle,
J. Hokkaido Univ. Ed. Se t. II A 46 (1995), no. 1 (August), 61{69.
[160 Shigeru Obara and Yuji Hirayama, The \Distribution of the tower of Hanoi"
puzzle, J. Hokkaido Univ. Ed. Se t. II A 47 (1997), no. 2 (February), 175{179.
[161 Anton Ohlert, A toy, August 19, 1884, United States Patent O e, Patent No.
303946.
Ivor Page, see [196.

Paul K. Sto kmeyer

B.

14

[162 Helmut Parts h and Peter Pepper, A family of rules for re ursion removal,
Inform. Pro ess. Lett. 5 (1976), no. 6 (De ember), 174{177. MR 56:1777.
[163 Henri de Parville, Revue des s ien es, Journal des Debats Politiques et
Litteraires (De . 27, 1883), 1{2.
[164 Henri de Parville, Re reations mathematiques: La tour d'Hano et la question
du Tonkin, La Nature, 12th year, 1st semester, no. 565 (Mar h 29, 1884), 285{
286. A modied version of item [163 above.
Oren Patashnik, see [84.
Peter Pepper, see [162.
Don Perkins, see [149.
[165 Alberto Pettorossi, Towers of Hanoi problems: Deriving iterative solutions by
program transformations, BIT 25 (1985), 327{334. MR 86d:68030.
[166 Alberto Pettorossi, Derivation of e ient programs for omputing sequen es of
a tions, Theoret. Comput. S i. 53 (1987), 151{167. MR 91e:68022.
[167 David G. Poole, Solution to problem 1350, Math. Mag. 64 (1991), 200{201.
[168 David [G. Poole, The bottlene k towers of Hanoi problem, J. Re reational Math.
24 (1992), no. 3, 203{207.
[169 David G. Poole, The towers and triangles of Professor Claus (or, Pas al knows
Hanoi), Math. Mag. 67 (1994), 323{344. MR 95m:05023.
S. T.-U. Rahman, see [102.
Anthony Ralston, see [148.
Jim Randall, see [7.
[170 G. C. Ray and A. A. K. Majumdar, A note on the bottlene k tower of Hanoi
problem, Chittagong Univ. Stud. Part II S i. 19 (1995), 27{34.
[171 G. C. Ray and A. A. K. Majumdar, A note on the y li tower of Hanoi problem,
Chittagong Univ. Stud. Part II S i. 19 (1995), 75{81.
G. C. A. Robson, see[17 amd [18.
Patri k J. Rodriguez, see [195.
[172 J. S. Rohl, The towers of Hanoi problem, Comput. J. 28 (1985), no. 3, 350.

Paul K. Sto kmeyer

B.

15

[173 J. S. Rohl, Towers of Hanoi: The derivation of some iterative versions, Comput.
J. 30 (1987), no. 1, 70{76.
[174 J. S. Rohl, The towers of Hanoi{a representation-free solution, SIGPLAN Noti es 22 (1987), 126.
[175 J. S. Rohl and T[homas D. Gedeon, Four-tower Hanoi and beyond, Pro eedings
of the 6th Australian Computer Conferen e, Sidney (1983), 156{162.
[176 J. S. Rohl and T[homas D. Gedeon, The Reve's puzzle, Comput. J. 29 (1986),
no. 2, 187{188. Corrigendum, 31 (1988), no. 2, 190
[177 Hamzeh H. Roomany, Letter to the editor, SIGPLAN Noti es 20 (1985), no. 4
(April), 15{16.
[178 Ted Roth, The tower of Brahma revisited, J. Re reational Math. 7 (1974), no. 2
(Spring), 116{119. Reprinted in Mathemati al Solitaires & Games, Benjamin L.
S hwartz, ed., Baywood Publishing Co., In ., Farmingdale, NY, 1980, pp. 26{
29.
[179 Eri Frank Russell, Now inhale, Astounding S ien e Fi tion (April 1959).
Reprinted in TV: 2000, editied by Issa Asimov, Faw ett Crest, 1982. ( tion).
[180 F. S arioni and H. [M. G. Speranza, A probabilisti analysis of an error orre ting algorithm for the towers of Hanoi puzzle, Inform. Pro ess. Lett. 18
(1984), 99{103. MR 87j:68057.
[181 F. S aroni and M. G. Speranza, The density fun tion of the number of moves
to omplete the towers of Hanoi puzzle, Ann. Oper. Res. 1 (1984), 291{303.
Andreas S hief, see [98.
[182 P. H. S houte, De Ringen van Brahma, Eigen Haard (1884), no. 22, 274{276.
[183 Allen J. S hwenk, Solution to problem 1350, Math. Mag. 64 (1991), 202{203.
[184 R. S. S orer, P. M. Grundy, and C. A. B. Smith, Some binary games, Math.
Gaz. 28 (1944), no. 280 (July), 96{103.
Jerey O. Shallit, see [7 and [9.
[185 Mi hael Shwarger, Another look at the tower of Hanoi, Math. Tea her 70 (1977),
no. 6 (September), 528{533.
Joseph R. Simmons III, see [195.

Paul K. Sto kmeyer

B.

16

[186 John Slater, Towers of Hanoi, Math. in S hool 23 (1994), no. 2 (Mar h), 28{29.
C. A. B. Smith, see [184.
M. G. Speranza, see [180 and [181.
[187 Manfred Stadel, Another nonre ursive algorithm for the towers of Hanoi, SIGPLAN Noti es 19 (1984), no. 9 (September), 34{36.
[188 Edmund Staples, The tower of Hanoi problem with arbitrary start and end
positions, SIGACT News 18 (1987), 61{64.
Mi hael Steen, see [130.
[189 B. M. Stewart, Advan ed problem 3918, Amer. Math. Monthly 46 (1939), 363.
[190 B. M. Stewart, Solution to advan ed problem 3918, Amer. Math. Monthly 48
(1941), 217{219.
[191 Ian Stewart, Visions mathematiques: Le lion, le lama et la laitue, Pour la
S ien e (August 1989), no. 142, 102{107. English version, The Lion, the Llama,
and the Lettu e, is Chapter 1 of Another Fine Math You've Got Me Into . . . ,
W. H. Freeman and Company, New York, 1992.
[192 Ian Stewart, Four en ounters with Sierpinski's gasket, Math. Intell. 17 (1995),
no. 1, 52{64. MR 96e:58083.
[193 Paul K. Sto kmeyer, Variations on the four-post tower of Hanoi puzzle, Congr.
Numer. 102 (1994), 3{12. (Pro eedings of the 25th Southeastern International
Conferen e on Combinatori s, Graph Theory and Computing)
[194 Paul K. Sto kmeyer, The average distan e between nodes in the y li tower of
Hanoi digraph, Graph Theory, Combinatori s, Algorithms, and Appli ations,
1997. To appear
[195 Paul K. Sto kmeyer, C. Douglas Bateman, James W. Clark, Cyrus R. Eyster,
Matthew T. Harrison, Ni holas A. Loehr, Patri k J. Rodriguez, and Joseph
Simmons III, Ex hanging disks in the tower of Hanoi, Internat. J. Comput.
Math. 59 (1995), 37{47.
[196 Jeyakesavan Veerasamy and Ivor Page, On the towers of Hanoi problem with
multiple spare pegs, Internat. J. Comput. Math. 52 (1994), 17{22.
[197 T. R. Walsh, The towers of Hanoi revisited: Moving the rings by ounting the
moves, Inform. Pro ess. Lett. 15 (1982), no. 2, 64{67. MR 83j:68039.

Paul K. Sto kmeyer

B.

17

[198 T. R. Walsh, A ase for iteration, Congr. Numer. 40 (1983), 409{417. (Pro eedings of the 14th Southeastern Conferen e on Combinatori s, Graph Theory
and Computing.) MR 85a:68066.
[199 T. R. Walsh, Iteration strikes ba k|at the y li towers of Hanoi, Inform.
Pro ess. Lett. 16 (1983), 91{93. MR 84g:68022.
[200 Ri hard L. Wexelblat, Editorial, SIGPLAN Noti es 20 (1985), no. 9 (September), 1.
[201 Deri k Wood, The towers of Brahma and Hanoi revisited, J. Re reational Math.
14 (1981-1982), no. 1, 17{24. MR 82i:68031.
[202 D[eri k Wood, Adjudi ating a towers of Hanoi ontest, Internat. J. Comput.
Math. 14 (1983), 199{207. MR 85b:68019.
Deri k Wood, see also [100.
[203 Jer-Shyan Wu and Rong-Jaye Chen, The towers of Hanoi problem with parallel
moves, Inform. Pro ess. Lett. 44 (1992), 241{243. MR 93k:68041.
[204 Jer-Shyan Wu and Rong-Jaye Chen, The towers of Hanoi problem with y li
parallel moves, Inform. Pro ess. Lett. 46 (1993), 1{6. MR 94a:68043.
[205 A. J. van Zanten, The omplexity of an optimal algorithm for the generalized
tower of Hanoi problem, Internat. J. Comput. Math. 36 (1990), 1{8.
[206 A. J. van Zanten, An optimal algorithm for the twin-tower problem, Delft Progr.
Report 15 (1991), 33{50. MR 92a:05001.
[207 A. J. van Zanten, An iterative optimal algorithm for the generalized tower of
Hanoi problem, Internat. J. Comput. Math. 39 (1991), 163{168.

Index of Journals Cited

ABACUS; Springer; New York, NY; ISSN 0724-6722.
A ta Inform. = A ta Informati a; Springer; Heidelberg, Germany; ISSN 0001-5903.
A ta Math. Vietnam. = A ta Mathemati a Vietnami a; National Center for S ienti
Resear h; Hanoi, Vietnam; ISSN 0251-4184.
AI Expert; Miller Freeman; San Fran is o, CA; ISSN 0888-3785.
Amer. Math. Monthly = The Ameri an Mathemati al Monthly; Mathemati al Asso iation of Ameri a; Washington, DC; ISSN 0002-9890.

Paul K. Sto kmeyer

B.

18

Ann. Oper. Res. = Annals of Operations Resear h; Baltzer S ien e Publishers; Am-

sterdam, The Netherlands; ISSN 0254-5330.

APL Quote Quad; Asso iation for Computing Ma hinery; New York, NY; ISSN 01636006.
Arti ial Intelligen e; North-Holland Publishing Co.; Amsterdam, The Netherlands;
ISSN 0004-3702.
Assessment; Psy hologi al Assessment Resour es, In .; Odessa, FL; ISSN 1073-1911.
Astounding S ien e Fi tion; Street & Smith Publi ations, In .; New York, NY.
Atti A ad. Ligure S i. Lett. = Atti della A ademia Ligure di S ienze e Lettere;

Genoa, Italy; ISSN 0365-0278.

Austral. Comput. S i. Comm. = Australian Computer S ien e Communi ations;

Queensland Univ. Te h.; Brisbane, Australia; ISSN 0157-3055.

Austral. Math. Tea her = The Australian Mathemati s Tea her; Australian Asso i-

ation of Mathemati s Tea hers; Adelaide, Australia; ISSN 0045-0685.

Boll. Un. Mat. Ital. A 6 = Unione Mathemati a Italiana. Bollettino. A. Serie VI;

Bologna, Italy; ISSN ****-****.

BIT; The BIT Foundation; Copenhagen, Denmark; ISSN 0006-3835.

Bull. Austral. Math. So . = Bulletin of the Australian Mathemati al So iety; Aus-

tralian Mathmati al So iety; Queensland, Australia; ISSN 0004-9727.

Bull. Centre Inform. = Bulletin of the Centre for Informati s; Waseda University;
Tokyo, Japan; ISSN 0911-3622.

Chittagong Univ. Stud. Part II S i. = Chittagong University studies Part II: S ien e;

University of Chittagong; Chittagong, Bangladesh; ISSN 0253-5459.

Cognitive Psy hology; A ademi Press, In .; New York NY; ISSN 0010-0285.
Comput. J. = The Computer Journal; British Computer So iety; ISSN 0010-4620.

Computer Language; Computer Language Publishing, Ltd.; San Fran is o, CA; ISSN

0749-2839.

Computing; Springer; Vienna, Austria; ISSN 0010-485X.

Congr. Numer. = Congressus Numerantium; Utilitas Mathemati a; Winnipeg, Man-

itoba, Canada; ISSN 0316-1382.

Crux Mathemati orum; Canadian Mathemati al So iety; Ottawa, Ontario, Canada;
ISSN 0705-0348.
Cze h. Math. J. = Cze hoslovak Mathemati al Journal; A ademia; Prague, Cze h
Republi ; ISSN 0011-4642.

Paul K. Sto kmeyer

B.

19

Delft Progr. Report = Delft Progress Report; Delft University Press; Delft, The

Netherlands; ISSN 0304-985X.

Dis rete Math. = Dis rete Mathemati s; Elsevier (North-Holland); Amsterdam, The

Netherlands; ISSN 0012-365X.

Engineering Appli ations of AI = Engineering Appli ations of Arti ial Intellegen e;

Pergamon Press Ltd.; Exeter, England; ISSN 0952-1976.

Egypt. Comput. J. = The Egyptian Computer Journal; Institute of Statisti al Studies
and Resear h; Cairo, Egypt; ISSN 0377-7154.
Enseign. Math. = L'Enseignement Mathematique: Revue Internationale, IIe Serie;

Commission Internationale de l'Enseignement Mathematique; Geneva, Switzerland;

ISSN 0013-8584.
Games; Playboy Enterprises; Chi ago, IL; ISSN 0199-9788.
IEEE Trans. Ed. = IEEE Transa tions on Edu ation; Institute of Ele tri al and
Ele troni s Engineers; New York, NY; ISSN 0018-9359.
IEEE Trans. Soft. Engin. = IEEE Transa tions on Software Engineering; Institute of
Ele tri al and Ele troni s Engineers; New York, NY; ISSN 0098-5589.
Indian J. Math. = Indian Journal of Mathemati s; Allahabad Mathemati al So iety;
Allahabad, India; ISSN 0019-5324.
Inform. Pro ess. Lett. = Information Pro essing Letters; Elsevier (North-Holland);
Amsterdam, The Netherlands; ISSN 0020-0190.
Inform. S i. = Information S ien es; an international journal; Elsevier; New York,

NY; ISSN 0020-0255.

Internat. J. Comput. Inform. S i. = International Journal of Computer and Information S ien es; Plenum Press; New York, NY; ISSN 0091-7036.
Internat. J. Comput. Math. = International Journal of Computer Mathemati s; Gor-

don & Brea h; ISSN 0020-7160.

Internat. J. Man-Ma hine Studies = International Journal of Man-Ma hine Studies;

A ademi Press; London, England; ISSN 0020-7373.

Internat. J. Math. Ed. S i. Te h. = International Journal of Mathemati al Edu ation

in S ien e and Te hnology; Taylor & Fran is; England; ISSN 0020-739X.
Izv. Nats. Akad. Nauk Respub. Kazakhstan Ser. Fiz.=Mat. = Natsionalnaya Akademiya Nauk Respubliki Kazakhstan. Izvestiya. Seriya Fizik0-Matemati heskaya; Al-

maty, Kazakhstan; ISSN 0002-3191.

J. Algorithms = Journal of Algorithms; A ademi Press; Orlando, FL; ISSN 0196-

6774.

Paul K. Sto kmeyer

B.

20

J. Austral. Math. So . Ser. B = Journal of the Australian Mathemati al So iety, Series B{Applied Mathemati s; Australian Mathemati al So iety; Canberra, Australia;

ISSN 0334-2700.

J. Bangladesh A ad. S i. = Journal of Bangladesh A ademy of S ien es; Bangladesh

A ademy of S ien es; Dhaka, Bangladesh; ISSN 0378-8121.

J. Combin. Inform. System S i. = Journal of Combinatori s, Information & System

S ien es; Forum for Interdis iplinary Mathemati s; New Delhi, India; ISSN 0250-

9628.

J. Comput. System S i. = Journal of Computer and System S ien es; A ademi Press;

Orlando, FL; ISSN 0022-0000.

J. Hokkaido Univ. Ed. Se t. II A = Journal of Hokkaido University of Edu ation,

Se tion II A; Hokkaido University of Edu ation; Sapporo, Japan; ISSN 0367-5939.
J. Inform. Optim. S i. = Journal of Information & Optimization S ien es; Analyti

Publishing; Delhi, India; ISSN 0252-2667.

J. Inform. Pro ess. = Journal of Information Pro essing; Information Pro essing So-

iety of Japan; Tokyo, Japan; ISSN 0387-6101.

J. Re reational Math. = Journal of Re reational Mathemati s; Baywood Publishing;

Amityville, NY; ISSN 0022-412x.

London Mag. = The London Magazine (Harmsworth London Magazine); Harmsworth

Brothers Limited; London, England.

Math. Comput. Modelling = Mathemati al and Computer Modelling; Pergamon (El-

sevier); Oxford, England; ISSN 0895-7177.

Math. Gaz. = The Mathemati al Gazette; The Mathemati al Asso iation; London,

England; ISSN 0025-5572.

Math. Intell. = The Mathemati al Intelligen er; Springer; New York, NY; ISSN 0343-

6993.

Math. Reviews = Mathemati al Reviews; Ameri an Matheamti al So iety; Provi-

den e, RI; ISSN 0025-5629.

Math. in S hool = Mathemati s in S hool; The Mathemati al Asso iation; London,

England; ISSN 0305-7259.

Math. Mag. = Mathemati s Magazine; Mathemati al Asso iation of Ameri a; Wash-

ington, DC; ISSN 0025-570X.

Math. Tea her = The Mathemati s Tea her; National Coun il of Tea hers of Math-

emati s; Reston, VA; ISSN 0025-5769.

Math. Tea hing = Mathemati s Tea hing; Asso iation of Tea hers of Mathemati s;
Nelson, Lan ashire, England; ISSN 0025-5785.

Paul K. Sto kmeyer

B.

21

MNU = Der Mathematis he und Naturwissens haftli he Unterri ht; Ferd. Dummlers;

Bonn, Germany; ISSN 0025-5866.

MU = Der Mathematik-Unterri ht; E. Klett; Stuttgart, Germany; ISSN 0025-5807.



Math. S i. Humaines = Mathematiques et S ien es Humaines; E ole
Hautes Etudes

S i. So .; Paris, Fran e; ISSN 0025-5815.

MICRO = MICRO - The 6502/6809 Journal; MICRO INK; Chelmsford, MA; ISSN

0271-9002.

MICRO-SYSTEMES; So iete Parisienne d'Edition; Paris, Fran e; ISSN 0183-5084.

Nova J. Math. Game Theory Algebra = Nova Journal of Mathemati s, Game Theory,
and Algebra; Nova S ien e Publishers, In .; New York, NY; ISSN 1060-9881.
Mesures - regulation - automatisme; Paris; ISSN 0026-0193.
Optimization; Gordon & Brea h; ISSN 0233-1934.
Pour la S ien e; So iete pour la S ien e; Paris, Fran e; ISSN 0153-4092.
Probab. Theory Relat. Fields = Probability Theory and Related Fields; Springer;

Berlin, Germany; ISSN 0178-8051.

Pro . Pakistan A ad. S i. = Pro eedings of the Pakistan A ademy of S ien es; Pak-

istan A ademy of S ien es; Islamabad, Pakistan; ISSN 0377-2969.

Program. Comput. Software = Programming and Computer Software (A translation

of signi ant arti les from Programmirovanie; Consultants Bureau; New York, NY;

ISSN 0361-7688.

Programmirovanie; Akademiya Nauk SSSR; Mos ow, USSR; ISSN 0132-3474.

Quantum; Springer; New York, NY; [National S ien e Tea hers Asso iation; Wash-

ington, DC; ISSN 1048-8820.

RAIRO Inform. Theor. Appl. = RAIRO Informatique Theorique et Appli ations /

Theoreti al Informati s and Appli ations; Paris, Fran e; ISSN 0988-3754; 0296-1598.
Rev. Roumaine Math. Pures Appl. = Revue Roumaine de Mathematiques Pures et
Appliquees; A ademie de la Republique Roumine; Bu harest, Romania; ISSN 0035-

3965.

SIAM J. Comput. = SIAM Journal on Computing; So iety for Industrial and Applied

Mathemati s; Philadelphia, PA; ISSN 1095-7111.

S i. Amer. = S ienti Ameri an; S ienti Ameri an In orporated; New York, NY;
ISSN 0036-8733.
SIGACT News; Asso iation for Computing Ma hinery; New York, NY; ISSN 01635700.

Paul K. Sto kmeyer

B.

22

SIGCSE Bull. = SIGCSE Bulletin; Asso iation for Computing Ma hinery; New York,

NY; ISSN 0097-8418.

SIGPLAN Noti es = ACM SIGPLAN Noti es; Asso iation for Computing Ma hinery;

New York, NY; ISSN 0362-1340.

Systems and Computers in Japan; S ripta Te hni a, In .; New York, NY; ISSN 0882-

1666.

Surikaisekikenkyusho Kokyuroku; Kyoto University; Kyoto, Japan;

Theoret. Comput. S i. = Theoreti al Computer S ien e; Elsevier (North-Holland);

Amsterdam, The Netherlands; ISSN 0304-3975.

Z. Oper. Res. Ser. A = Zeits hrift fur Operations Resear h, Serie A; Physi a; Heidel-

berg, Germany; ISSN 0340-9422.