{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:47:59Z","timestamp":1761806879443},"reference-count":12,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0167-739x(02)00073-0","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T11:40:59Z","timestamp":1034336459000},"page":"939-950","source":"Crossref","is-referenced-by-count":10,"title":["Leader election in d-dimensional CA in time diam log(diam)"],"prefix":"10.1016","volume":"18","author":[{"given":"Michael","family":"Stratmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Worsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(02)00073-0_BIB1","doi-asserted-by":"crossref","unstructured":"A. Beckers, T. Worsch, A perimeter-time CA for the queen-bee problem, in: S. Bandini, R. Serra, F.S. Liverani (Eds.), Cellular Automata: Research Towards Industry, Springer, London, 1998, pp. 15\u201325.","DOI":"10.1007\/978-1-4471-1281-5_2"},{"issue":"5","key":"10.1016\/S0167-739X(02)00073-0_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0167-8191(00)00077-6","article-title":"A perimeter-time CA for the queen-bee problem","volume":"27","author":"Beckers","year":"2001","journal-title":"Parallel Comput."},{"issue":"2","key":"10.1016\/S0167-739X(02)00073-0_BIB3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0304-3975(98)00330-2","article-title":"Discrete parabolas and circles on 2D cellular automata","volume":"218","author":"Delorme","year":"1999","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB4","unstructured":"A. Hemmerling, Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces, in: L. Budach (Ed.), Proceedings of the International Conference on Fundamentals of Computation Theory (FCT\u201979), Akademie Verlag, Berlin, 1979, pp. 167\u2013174."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","article-title":"A six-state minimal time solution to the firing squad synchronization problem","volume":"50","author":"Mazoyer","year":"1987","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB6","unstructured":"J. Mazoyer, C. Nichitiu, E. R\u00e9mila, Compass permits leader election, in: Proceedings of the SODA\u201999, 1999, pp. 947\u2013948."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB7","doi-asserted-by":"crossref","unstructured":"C. Nichitiu, E. R\u00e9mila, Leader election by d-dimensional cellular automata, in: Proceedings of the 26th International Colloquium (ICALP) on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 565\u2013574.","DOI":"10.1007\/3-540-48523-6_53"},{"key":"10.1016\/S0167-739X(02)00073-0_BIB8","doi-asserted-by":"crossref","unstructured":"A.R. Smith III, Two-dimensional formal languages and pattern recognition by cellular automata, in: Proceedings of the 12th Annual IEEE Symposium on Switching and Automata Theory, 1971, pp. 144\u2013152.","DOI":"10.1109\/SWAT.1971.29"},{"key":"10.1016\/S0167-739X(02)00073-0_BIB9","unstructured":"M. Stratmann, Eine L\u00f6sung f\u00fcr das queen-bee-problem in Zeit O(diam(logdiam)dim+1), Studienarbeit, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 2000."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB10","unstructured":"L. Tougne, Cercles discrets sur automates cellulaires, Ph.D. Thesis, Ecole Normale Sup\u00e9rieure de Lyon, 1997."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB11","first-page":"293","article-title":"On two modified problems of synchronization in cellular automata","volume":"3","author":"Vollmar","year":"1977","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0167-739X(02)00073-0_BIB12","doi-asserted-by":"crossref","unstructured":"R. Vollmar, Algorithmen in Zellularautomaten, Teubner, Stuttgart, 1979.","DOI":"10.1007\/978-3-322-96671-1"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X02000730?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X02000730?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T09:21:05Z","timestamp":1554974465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X02000730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0167739X02000730"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(02)00073-0","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}