{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:02Z","timestamp":1759335902470},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430803"},{"type":"electronic","value":"9783540455790"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45579-5_13","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:52:18Z","timestamp":1195235538000},"page":"204-213","source":"Crossref","is-referenced-by-count":2,"title":["Virus Versus Mankind"],"prefix":"10.1007","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"13_CR1","volume-title":"Winning Ways for your mathematical plays","author":"E. R. Berlekamp","year":"1982","unstructured":"E. R. Berlekamp, J. H. Conway and R. K. Guy. Winning Ways for your mathematical plays. (Two volumes), Academic Press, London, 1982."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1018611014097","volume":"9","author":"N. L. Biggs","year":"1999","unstructured":"N. L. Biggs. Chip-firing and the critical group of a graph. J. Algebr. Comb.\n                           9,25\u201345, 1999.","journal-title":"J. Algebr. Comb."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1022467132614","volume":"1","author":"A. Bj\u00f6rner","year":"1992","unstructured":"A. Bj\u00f6rner and L. Lov\u00e1sz. Chip-firing on directed graphs. J. Algebr. Comb.\n                           1,305\u2013328, 1992.","journal-title":"J. Algebr. Comb."},{"key":"13_CR4","volume-title":"On Numbers and Games","author":"J. H. Conway","year":"1976","unstructured":"J. H. Conway. On Numbers and Games. Academic Press, London, 1976."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0012-365X(90)90008-6","volume":"83","author":"J. H. Conway","year":"1990","unstructured":"J. H. Conway. Integral lexicographic codes. Discrete Math.\n                           83, 219\u2013235, 1990.","journal-title":"Discrete Math."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1986.1057187","volume":"IT-32","author":"J. H. Conway","year":"1986","unstructured":"J. H. Conway and N. J. A. Sloane. Lexicographic codes: error-correcting codes from game theory. IEEE Trans. Inform. Theory\n                           IT-32, 337\u2013348, 1986.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0097-3165(84)90046-3","volume":"37","author":"T. S. Ferguson","year":"1984","unstructured":"T. S. Ferguson. Mis\u00e8re annihilation games. J. Combin. Theory (Ser. A) 37, 205\u2013230, 1984.","journal-title":"J. Combin. Theory"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"A. S. Fraenkel. Combinatorial games with an annihilation rule. In The Influence of Computing on Mathematical Research and Education, Proc. Symp. Appl. Math. (J. P. LaSalle, ed.),Vol. 20, Amer. Math. Soc., Providence, RI, pp. 87\u201391, 1974.","DOI":"10.1090\/psapm\/020\/9915"},{"key":"13_CR9","first-page":"417","volume-title":"Games of No Chance","author":"A. S. Fraenkel","year":"1996","unstructured":"A. S. Fraenkel. Error-correcting codes derived from combinatorial games. In Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July, 1994, Berkeley, CA, MSRI Publ. (R. J. Nowakowski, ed.),Vol. 29, Cambridge University Press, Cambridge, pp. 417\u2013431, 1996."},{"key":"13_CR10","first-page":"13","volume-title":"Games of No Chance","author":"A. S. Fraenkel","year":"1996","unstructured":"A. S. Fraenkel. Scenic trails ascending from sea-level Nim to alpine chess. In Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July, 1994, Berkeley, CA, MSRI Publ. (R. J. Nowakowski, ed.), Vol. 29, Cambridge University Press, Cambridge, pp. 13\u201342, 1996."},{"key":"13_CR11","volume-title":"More Games of No Chance","author":"A. S. Fraenkel","year":"2001","unstructured":"A. S. Fraenkel. Two-player games on cellular automata. To appear in: More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July, 2000, Berkeley, CA, MSRI Publ. (R. J. Nowakowski, ed.), Cambridge University Press, Cambridge, 2001."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0097-3165(87)90074-4","volume":"46","author":"A. S. Fraenkel","year":"1987","unstructured":"A. S. Fraenkel and E. Goldschmidt. Pspace-hardness of some combinatorial games. J. Combin. Theory (Ser. A) 46, 21\u201338, 1987.","journal-title":"J. Combin. Theory"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1090\/S0002-9904-1976-14160-2","volume":"82","author":"A. S. Fraenkel","year":"1976","unstructured":"A. S. Fraenkel and Y. Yesha. Theory of annihilation games. Bull. Amer. Math. Soc.\n                           82, 775\u2013777, 1976.","journal-title":"Bull. Amer. Math. Soc."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0166-218X(79)90012-X","volume":"1","author":"A. S. Fraenkel","year":"1979","unstructured":"A. S. Fraenkel and Y. Yesha. Complexity of problems in games, graphs and algebraic equations. Discrete Appl. Math.\n                           1, 15\u201330, 1979.","journal-title":"Discrete Appl. Math."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0095-8956(82)90058-2","volume":"33","author":"A. S. Fraenkel","year":"1982","unstructured":"A. S. Fraenkel and Y. Yesha. Theory of annihilation games \u2014 I. J. Combin. Theory (Ser. B) 33, 60\u201386, 1982.","journal-title":"J. Combin. Theory"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0097-3165(86)90058-0","volume":"43","author":"A. S. Fraenkel","year":"1986","unstructured":"A. S. Fraenkel and Y. Yesha. The generalized Sprague-Grundy function and its invariance under certain mappings. J. Combin. Theory (Ser. A) 43, 165\u2013177, 1986.","journal-title":"J. Combin. Theory"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)80012-3","volume":"143","author":"A. S. Goldstein","year":"1995","unstructured":"A. S. Goldstein and E. M. Reingold. The complexity of pursuit on a graph. Theoret. Comput. Sci. (Math Games) 143, 93\u2013112, 1995.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR18","first-page":"101","volume":"64","author":"E. Goles","year":"1991","unstructured":"E. Goles. Sand piles, combinatorial games and cellular automata. Math. Appl.\n                           64, 101\u2013121, 1991.","journal-title":"Math. Appl."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02558479","volume":"1","author":"C. M. L\u00f3pez","year":"1997","unstructured":"C. M. L\u00f3pez. Chip firing and the Tutte polynomial. Ann. of Comb.\n                           1, 253\u2013259, 1997.","journal-title":"Ann. of Comb."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2307\/2322414","volume":"94","author":"D. H. Pelletier","year":"1987","unstructured":"D. H. Pelletier. Merlin\u2019s magic square. Amer. Math. Monthly\n                           94, 143\u2013150, 1987.","journal-title":"Amer. Math. Monthly"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"V. Pless. Games and codes. In Combinatorial Games, Proc. Symp. Appl. Math. (R. K. Guy, ed.), Vol. 43, Amer. Math. Soc., Providence, RI, pp. 101\u2013110, 1991.","DOI":"10.1090\/psapm\/043\/1095542"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0021-9800(66)80005-4","volume":"1","author":"C. A. B. Smith","year":"1966","unstructured":"C. A. B. Smith. Graphs and composite games. J. Combin. Theory\n                           1, 51\u201381, 1966. Reprinted in slightly modified form in: A Seminar on Graph Theory (F. Harary, ed.), Holt, Rinehart and Winston, NewYork, NY, 1967.","journal-title":"J. Combin. Theory"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/2325180","volume":"96","author":"D. L. Stock","year":"1989","unstructured":"D. L. Stock. Merlin\u2019s magic square revisited. Amer. Math. Monthly\n                           96, 608\u2013610, 1989.","journal-title":"Amer. Math. Monthly"},{"key":"13_CR24","first-page":"1","volume":"2","author":"K. Sutner","year":"1988","unstructured":"K. Sutner. On \u03c3-automata. Complex Systems\n                           2, 1\u201328, 1988.","journal-title":"Complex Systems"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03023823","volume":"11","author":"K. Sutner","year":"1989","unstructured":"K. Sutner. Linear cellular automata and the Garden-of-Eden. Math. Intelligencer\n                           11, 49\u201353, 1989.","journal-title":"Math. Intelligencer"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"24","DOI":"10.2307\/2323999","volume":"97","author":"K. Sutner","year":"1990","unstructured":"K. Sutner. The \u03c3-game and cellular automata. Amer. Math. Monthly\n                           97, 24\u201334, 1990.","journal-title":"Amer. Math. Monthly"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcss.1995.1009","volume":"50","author":"K. Sutner","year":"1995","unstructured":"K. Sutner. On the computational complexity of finite cellular automata. J. Comput. System Sci.\n                           50, 87\u201397, 1995.","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45579-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T16:14:49Z","timestamp":1551111289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45579-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430803","9783540455790"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45579-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}