{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:59Z","timestamp":1725459119927},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0036910","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:38:14Z","timestamp":1138210694000},"page":"203-225","source":"Crossref","is-referenced-by-count":0,"title":["Wythoff games, continued fractions, cedar trees and Fibonacci searches"],"prefix":"10.1007","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Winning Ways","author":"E.R. Berlekamp","year":"1982","unstructured":"E.R. Berlekamp, J.H. Conway and R.K. Guy, Winning Ways, Academic Press, London, 1982."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"6","DOI":"10.4153\/CJM-1969-002-7","volume":"21","author":"A.S. Fraenkel","year":"1969","unstructured":"A.S. Fraenkel, The bracket function and complementary sets of integers, Can. J. Math. 21 (1969), 6\u201327.","journal-title":"Can. J. Math."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/00029890.1982.11995454","volume":"89","author":"A.S. Fraenkel","year":"1982","unstructured":"A.S. Fraenkel, How to beat your Wythoff games' opponent on three fronts, Amer. Math. Monthly 89 (1982), 353\u2013361.","journal-title":"Amer. Math. Monthly"},{"key":"18_CR4","unstructured":"G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, Oxford University Press, 4-th Edition, 1960."},{"key":"18_CR5","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, MD, 1978."},{"key":"18_CR6","volume-title":"The Art of Computer Programming, Vol. 3; Sorting and Searching","author":"D.E. Knuth","year":"1975","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 3; Sorting and Searching, Addison-Wesley, Reading, MA, Second Printing, 1975."},{"key":"18_CR7","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9780883859261","volume-title":"Continued Fractions","author":"C.D. Olds","year":"1963","unstructured":"C.D. Olds, Continued Fractions, Random House, New York, 1963."},{"key":"18_CR8","volume-title":"Die Lehre von den Kettenbr\u00fcchen, Band I","author":"O. Perron","year":"1954","unstructured":"O. Perron, Die Lehre von den Kettenbr\u00fcchen, Band I, Teubner, Stuttgart, 1954."},{"key":"18_CR9","first-page":"199","volume":"7","author":"W. Wythoff","year":"1907","unstructured":"W. Wythoff, A modification of the game of Nim, Nieuw Arch. Wisk. 7 (1907), 199\u2013202.","journal-title":"Nieuw Arch. Wisk."},{"key":"18_CR10","volume-title":"Challenging Mathematical Problems with Elementary Solutions","author":"A.M. Yaglom","year":"1967","unstructured":"A.M. Yaglom and I.M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, translated by J. McCawley, Jr., revised and edited by B. Gordon, Vol. II, Holden-Day, San Francisco, 1967."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036910.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:21:31Z","timestamp":1607552491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123172"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0036910","relation":{},"subject":[]}}