{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:41:25Z","timestamp":1725878485805},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319520148"},{"type":"electronic","value":"9783319520155"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52015-5_44","type":"book-chapter","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T03:51:57Z","timestamp":1484193117000},"page":"429-438","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Algorithm for a Computer Game in Linear Time"],"prefix":"10.1007","author":[{"given":"Daxin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,13]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511763199","volume-title":"Pearls of Functional Algorithm Design","author":"R Bird","year":"2010","unstructured":"Bird, R.: Pearls of Functional Algorithm Design. Cambridge University Press, Cambridge (2010). pp. 258\u2013274"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44683-4_3","volume-title":"Mathematical Foundations of Computer Science 2001","author":"ED Demaine","year":"2001","unstructured":"Demaine, E.D.: Playing games with algorithms: algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18\u201333. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44683-4_3"},{"issue":"3","key":"44_CR3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s00224-005-1241-3","volume":"39","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Demaine, M.L.: Puzzles, art, and magic with algorithms. Theor. Comput. Syst. 39(3), 473\u2013481 (2006)","journal-title":"Theor. Comput. Syst."},{"key":"44_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199740444.001.0001","volume-title":"Algorithmic Puzzles","author":"A Levitin","year":"2011","unstructured":"Levitin, A., Levitin, M.: Algorithmic Puzzles. Oxford University Press, New York (2011). pp. 3\u201331"},{"key":"44_CR5","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison Wesley, Boston (2005). pp. 223\u2013238"},{"key":"44_CR6","volume-title":"Combinatorial Algorithms: Generation, Enumeration and Search","author":"DL Kreher","year":"1998","unstructured":"Kreher, D.L., Stinson, D.: Combinatorial Algorithms: Generation, Enumeration and Search. CRC Press, New York (1998). pp. 125\u2013133"},{"issue":"1","key":"44_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF02946986","volume":"10","author":"JS Gray","year":"1998","unstructured":"Gray, J.S.: The shuttle puzzle a lesson in problem solving. J. Comput. High. Educ. 10(1), 56\u201370 (1998)","journal-title":"J. Comput. High. Educ."},{"key":"44_CR8","volume-title":"Algorithm Design and Applications","author":"MT Goodrich","year":"2014","unstructured":"Goodrich, M.T., Tamassia, R.: Algorithm Design and Applications. Wiley, Hoboken (2014). pp. 239\u2013325"},{"key":"44_CR9","unstructured":"Fibonacci numbers. In: Hazewinkel, M. (ed.) Encyclopedia of Mathematics, vol. 2, pp. 55\u201356. Springer (2001)"}],"container-title":["Lecture Notes in Computer Science","Smart Computing and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52015-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T10:44:47Z","timestamp":1658400287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52015-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319520148","9783319520155"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52015-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}