{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:12Z","timestamp":1759638372362},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:35:58Z","timestamp":1184592958000},"page":"248-259","source":"Crossref","is-referenced-by-count":4,"title":["On Optimal Solutions for the Bottleneck Tower of Hanoi Problem"],"prefix":"10.1007","author":[{"given":"Yefim","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"Shay","family":"Solomon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Beneditkis, S., Safro, I.: Generalizations of the Tower of Hanoi Problem. Final Project Report, supervised by Berend, D., Dept. of Mathematics and Computer Science, Ben-Gurion University (1998)"},{"key":"20_CR2","unstructured":"Chen, X., Tian, B., Wang, L.: Santa Claus\u2019 Towers of Hanoi. Manuscript (2005)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11940128_6","volume-title":"Algorithms and Computation","author":"Y. Dinitz","year":"2006","unstructured":"Dinitz, Y., Solomon, S.: Optimal algorithms for tower of hanoi problems with relaxed placement rules. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 36\u201347. Springer, Heidelberg (2006)"},{"issue":"3","key":"20_CR4","first-page":"203","volume":"24","author":"D. Poole","year":"1992","unstructured":"Poole, D.: The Bottleneck Towers of Hanoi Problem. J. of Recreational Math.\u00a024(3), 203\u2013207 (1992)","journal-title":"J. of Recreational Math."},{"key":"20_CR5","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, p. 356. Springer, Heidelberg (1999)"},{"issue":"1","key":"20_CR6","first-page":"17","volume":"14","author":"D. Wood","year":"1981","unstructured":"Wood, D.: The Towers of Brahma and Hanoi Revisited. J. of Recreational Math.\u00a014(1), 17\u201324 (1981)","journal-title":"J. of Recreational Math."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:11:22Z","timestamp":1550434282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}