{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:22:01Z","timestamp":1773386521502,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"value":"354056764X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029807","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:36:08Z","timestamp":1133411768000},"page":"215-227","source":"Crossref","is-referenced-by-count":11,"title":["A unifying look at d-dimensional periodicities and space coverings"],"prefix":"10.1007","author":[{"given":"Mireille","family":"R\u00e9gnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladan","family":"Rostami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"A. Amir and G. Benson. Two-dimensional periodicity and its application. In SODA'92, 1992. Proc. 3-rd Symposium on Discrete Algorithms, Orlando, FL."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In STOC'92, pages 59\u201367, 1992. Victoria,BC.","DOI":"10.1145\/129712.129719"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and M. R\u00e9gnier. Fast algorithms for two dimensional and multiple pattern matching. In SWAT'90, volume 447 of Lecture Notes in Computer Science, pages 332\u2013347. Springer-Verlag, 1990. Preliminary draft in Proc. Swedish Workshop on Algorithm Theory, Bergen, Norway. To appear in IPL.","DOI":"10.1007\/3-540-52846-6_102"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"R. Cole and R. Hariharan. Tighter Bounds on the Exact Complexity of String Matching. In FOCS'92. IEEE, 1992. Proc. 33-rd IEEE Conference on Foundations of Computer Science, Pittsburgh, USA.","DOI":"10.1109\/SFCS.1992.267791"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Z. Galil. Hunting Lions in the Desert Optimally or a Constant-Time Optimal Parallel String-Matching Algorithm. In STOCS'92, 1992. Victoria,BC.","DOI":"10.1145\/129712.129720"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Z. Galil and K. Park. Truly Alphabet Independent Two-Dimensional Pattern Matching. In FOCS'92. IEEE, 1992. Proc. 33-rd IEEE Conference on Foundations of Computer Science, Pittsburgh, USA.","DOI":"10.1109\/SFCS.1992.267767"},{"key":"16_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4752-4","volume-title":"Elliptic Functions","author":"S. Lang","year":"1987","unstructured":"S. Lang. Elliptic Functions. Springer-Verlag, New-York, 1987."},{"key":"16_CR8","volume-title":"Combinatorics on Words","author":"Lothaire","year":"1983","unstructured":"Lothaire. Combinatorics on Words. Addison-Wesley, Reading, Mass., 1983."},{"key":"16_CR9","unstructured":"P. Nicod\u00e8me and M. R\u00e9gnier. Towards 2D Pattern Matching Complexity, 1992. in preparation."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"M. R\u00e9gnier. Knuth-Morris-Pratt algorithm: an analysis. In MFCS'89, volume 379 of Lecture Notes in Computer Science, pages 431\u2013444. Springer-Verlag, 1989. Proc. Mathematical Foundations for Computer Science 89, Porubka, Poland.","DOI":"10.1007\/3-540-51486-4_90"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(85)80028-0","volume":"67","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin. Optimal Parallel Pattern Matching in Strings. Information and Control, 67:91\u2013113, 1985.","journal-title":"Information and Control"},{"issue":"9","key":"16_CR12","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1145\/66451.66459","volume":"32","author":"R.F. Zhu","year":"1989","unstructured":"R.F. Zhu and T. Takaoka. A technique for two-dimensional pattern matching. CACM., 32(9):1110\u20131120, 1989.","journal-title":"CACM."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:33:59Z","timestamp":1586579639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354056764X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0029807","relation":{},"subject":[]}}