{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:01Z","timestamp":1759638481166},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90004-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"351-358","source":"Crossref","is-referenced-by-count":9,"title":["The complexity of the generalised cyclic Towers of Hanoi problem"],"prefix":"10.1016","volume":"6","author":[{"given":"M.C","family":"Er","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90004-5_BIB1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0020-0190(81)90123-X","article-title":"The cyclic Towers of Hanoi","volume":"13","author":"Atkinson","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90004-5_BIB2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(80)90150-7","article-title":"The Towers of Hanoi problem","volume":"10","author":"Buneman","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90004-5_BIB3","article-title":"A Short Introduction to the Art of Programming","author":"Dijkstra","year":"1971","journal-title":"EWD 316"},{"key":"10.1016\/0196-6774(85)90004-5_BIB4","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1093\/comjnl\/25.4.442","article-title":"A representation approach to the Tower of Hanoi problem","volume":"25","author":"Er","year":"1982","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(85)90004-5_BIB5","series-title":"An Iterative Solution to the Cyclic Towers of Hanoi Problem","author":"Er","year":"1982"},{"key":"10.1016\/0196-6774(85)90004-5_BIB6","series-title":"Technical Report","article-title":"The Cyclic Towers of Hanoi: A generalization","author":"Er","year":"1982"},{"key":"10.1016\/0196-6774(85)90004-5_BIB7","series-title":"Technical Report","article-title":"A Generalization of the Cyclic Towers of Hanoi: An Iterative Solution","author":"Er","year":"1982"},{"key":"10.1016\/0196-6774(85)90004-5_BIB8","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1093\/comjnl\/20.3.282","article-title":"A note on the Towers of Hanoi problem","volume":"20","author":"Hayes","year":"1977","journal-title":"Comput. J."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:09Z","timestamp":1548743169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900045"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90004-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}