{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:28Z","timestamp":1725456628156},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_11","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"81-90","source":"Crossref","is-referenced-by-count":0,"title":["Which Multi-peg Tower of Hanoi Problems Are Exponential?"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Berend","sequence":"first","affiliation":[]},{"given":"Amir","family":"Sapir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.2307\/2974693","volume":"101","author":"J.-P. Allouche","year":"1994","unstructured":"Allouche, J.-P., Astoorian, D., Randall, J., Shallit, J.: Morphisms, squarefree strings, and the Tower of Hanoi puzzle. Amer. Math. Monthly\u00a0101, 651\u2013658 (1994)","journal-title":"Amer. Math. Monthly"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11505877_1","volume-title":"Developments in Language Theory","author":"J.-P. Allouche","year":"2005","unstructured":"Allouche, J.-P., Sapir, A.: Restricted Towers of Hanoi and Morphisms. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol.\u00a03572, pp. 1\u201310. Springer, Heidelberg (2005)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0020-0190(81)90123-X","volume":"13","author":"M.D. Atkinson","year":"1981","unstructured":"Atkinson, M.D.: The cyclic Towers of Hanoi. Inform. Process. Lett.\u00a013, 118\u2013119 (1981)","journal-title":"Inform. Process. Lett."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.tcs.2006.09.019","volume":"369","author":"D. Azriel","year":"2006","unstructured":"Azriel, D., Berend, D.: On a question of Leiss regarding the Hanoi Tower problem. Theoretical Computer Science\u00a0369, 377\u2013383 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/1159892.1159893","volume":"2","author":"D. Berend","year":"2006","unstructured":"Berend, D., Sapir, A.: The Cyclic multi-peg Tower of Hanoi. Trans. on Algorithms\u00a02(3), 297\u2013317 (2006)","journal-title":"Trans. on Algorithms"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ipl.2005.12.004","volume":"98","author":"D. Berend","year":"2006","unstructured":"Berend, D., Sapir, A.: The diameter of Hanoi graphs. Inform. Process. Lett.\u00a098, 79\u201385 (2006)","journal-title":"Inform. Process. Lett."},{"key":"11_CR7","unstructured":"Berend, D., Sapir, A., Solomon, S.: Subexponential upper bound for the Path multi-peg Tower of Hanoi. Disc. Appl. Math (2012)"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1137\/S0097539703431019","volume":"33","author":"X. Chen","year":"2004","unstructured":"Chen, X., Shen, J.: On the Frame-Stewart conjecture about the Towers of Hanoi. SIAM J. on Computing\u00a033(3), 584\u2013589 (2004)","journal-title":"SIAM J. on Computing"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367065","volume":"4","author":"Y. Dinitz","year":"2008","unstructured":"Dinitz, Y., Solomon, S.: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. Trans. on Algorithms\u00a04(3), 1\u20139 (2008)","journal-title":"Trans. on Algorithms"},{"key":"11_CR10","volume-title":"The Canterbury Puzzles (and Other Curious Problems","author":"H.E. Dudeney","year":"1908","unstructured":"Dudeney, H.E.: The Canterbury Puzzles (and Other Curious Problems). E. P. Dutton, New York (1908)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1093\/comjnl\/27.2.171","volume":"27","author":"M.C. Er","year":"1984","unstructured":"Er, M.C.: The Cyclic Towers of Hanoi: a representation approach. Comput. J.\u00a027(2), 171\u2013175 (1984)","journal-title":"Comput. J."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0255(87)90020-X","volume":"42","author":"M.C. Er","year":"1987","unstructured":"Er, M.C.: A general algorithm for finding a shortest path between two n-configurations. Inform. Sci.\u00a042, 137\u2013141 (1987)","journal-title":"Inform. Sci."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.2307\/2304268","volume":"48","author":"J.S. Frame","year":"1941","unstructured":"Frame, J.S.: Solution to advanced problem 3918. Amer. Math. Monthly\u00a048, 216\u2013217 (1941)","journal-title":"Amer. Math. Monthly"},{"issue":"6","key":"11_CR14","first-page":"841","volume":"22","author":"D.-J. Guan","year":"1998","unstructured":"Guan, D.-J.: Generalized Gray codes with applications. Proc. Natl. Sci. Counc. ROC(A)\u00a022(6), 841\u2013848 (1998)","journal-title":"Proc. Natl. Sci. Counc. ROC(A)"},{"issue":"1-3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(01)00287-6","volume":"120","author":"S. Klav\u017ear","year":"2002","unstructured":"Klav\u017ear, S., Milutinovi\u0107, U., Petr, C.: On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. Disc. Appl. Math.\u00a0120(1-3), 141\u2013157 (2002)","journal-title":"Disc. Appl. Math."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0012-365X(93)90373-2","volume":"114","author":"C.S. Klein","year":"1993","unstructured":"Klein, C.S., Minsker, S.: The super Towers of Hanoi problem: large rings on small rings. Disc. Math.\u00a0114, 283\u2013295 (1993)","journal-title":"Disc. Math."},{"issue":"1","key":"11_CR17","first-page":"81","volume":"8","author":"E.L. Leiss","year":"1983","unstructured":"Leiss, E.L.: Solving the \u201cTowers of Hanoi\u201d on graphs. J. Combin. Inform. System Sci.\u00a08(1), 81\u201389 (1983)","journal-title":"J. Combin. Inform. System Sci."},{"key":"11_CR18","volume-title":"R\u00e9cr\u00e9ations Math\u00e9matiques","author":"\u00c9. Lucas","year":"1893","unstructured":"Lucas, \u00c9.: R\u00e9cr\u00e9ations Math\u00e9matiques, vol.\u00a0III. Gauthier-Villars, Paris (1893)"},{"key":"11_CR19","unstructured":"Lunnon, W.F., Stockmeyer, P.K.: New Variations on the Tower of Hanoi. In: 13th Intern. Conf. on Fibonacci Numbers and Their Applications (2008)"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0020-0190(91)90230-F","volume":"38","author":"S. Minsker","year":"1991","unstructured":"Minsker, S.: The Towers of Antwerpen problem. Inform. Process. Lett.\u00a038(2), 107\u2013111 (1991)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1345375.1345410","volume":"39","author":"S. Minsker","year":"2007","unstructured":"Minsker, S.: The Linear Twin Towers of Hanoi problem. Bulletin of ACM SIG on Comp. Sci. Education\u00a039(4), 37\u201340 (2007)","journal-title":"Bulletin of ACM SIG on Comp. Sci. Education"},{"issue":"4","key":"11_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1473195.1473215","volume":"40","author":"S. Minsker","year":"2008","unstructured":"Minsker, S.: Another brief recursion excursion to Hanoi. Bulletin of ACM SIG on Comp. Sci. Education\u00a040(4), 35\u201337 (2008)","journal-title":"Bulletin of ACM SIG on Comp. Sci. Education"},{"issue":"4","key":"11_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/1709424.1709446","volume":"41","author":"S. Minsker","year":"2009","unstructured":"Minsker, S.: The classical\/linear Hanoi hybrid problem: regular configurations. Bulletin of ACM SIG on Comp. Sci. Education\u00a041(4), 57\u201361 (2009)","journal-title":"Bulletin of ACM SIG on Comp. Sci. Education"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"P\u00f3lya, G., Szeg\u0151, G.: Problems and Theorems in Analysis, vol.\u00a0I. Springer (1972)","DOI":"10.1007\/978-3-642-61983-0"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1093\/comjnl\/47.1.20","volume":"47","author":"A. Sapir","year":"2004","unstructured":"Sapir, A.: The Tower of Hanoi with forbidden moves. Comput. J.\u00a047(1), 20\u201324 (2004)","journal-title":"Comput. J."},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"96","DOI":"10.2307\/3606393","volume":"280","author":"R.S. Scorer","year":"1944","unstructured":"Scorer, R.S., Grundy, P.M., Smith, C.A.B.: Some binary games. Math. Gazette\u00a0280, 96\u2013103 (1944)","journal-title":"Math. Gazette"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/2302907","volume":"46","author":"B.M. Stewart","year":"1939","unstructured":"Stewart, B.M.: Advanced problem 3918. Amer. Math. Monthly\u00a046, 363 (1939)","journal-title":"Amer. Math. Monthly"},{"key":"11_CR28","first-page":"217","volume":"48","author":"B.M. Stewart","year":"1941","unstructured":"Stewart, B.M.: Solution to advanced problem 3918. Amer. Math. Monthly\u00a048, 217\u2013219 (1941)","journal-title":"Amer. Math. Monthly"},{"key":"11_CR29","first-page":"3","volume":"102","author":"P.K. Stockmeyer","year":"1994","unstructured":"Stockmeyer, P.K.: Variations on the Four-Post Tower of Hanoi puzzle. Congr. Numer.\u00a0102, 3\u201312 (1994)","journal-title":"Congr. Numer."},{"key":"11_CR30","unstructured":"Stockmeyer, P.K.: Tower of hanoi bibliography (2005), \n                    \n                      http:\/\/www.cs.wm.edu\/~pkstoc\/biblio2.pdf"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-49116-3_33","volume-title":"STACS 99","author":"M. Szegedy","year":"1999","unstructured":"Szegedy, M.: In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved? In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 356\u2013361. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:37Z","timestamp":1620133237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}