{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:41:20Z","timestamp":1725594080036},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_16","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"173-183","source":"Crossref","is-referenced-by-count":9,"title":["Simple Real-Time Constant-Space String Matching"],"prefix":"10.1007","author":[{"given":"Dany","family":"Breslauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/968280.968312","volume-title":"FPGA","author":"Z.K. Baker","year":"2004","unstructured":"Baker, Z.K., Prasanna, V.K.: Time and area efficient pattern matching on FPGAs. In: Tessier, R., Schmit, H. (eds.) FPGA, pp. 223\u2013232. ACM, New York (2004)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(95)00068-2","volume":"158","author":"D. Breslauer","year":"1996","unstructured":"Breslauer, D.: Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. Theoret. Comput. Sci.\u00a0158(1), 177\u2013192 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Breslauer, D., Galil, Z.: Real-Time Streaming String-Matching (2011), this conference proceedings","DOI":"10.1007\/978-3-642-21458-5_15"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1006\/jagm.1997.0861","volume":"24","author":"D. Breslauer","year":"1997","unstructured":"Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms\u00a024(2), 340\u2013353 (1997)","journal-title":"J. Algorithms"},{"issue":"A","key":"16_CR5","first-page":"1175","volume":"286","author":"Y. C\u00e9sari","year":"1978","unstructured":"C\u00e9sari, Y., Vincent, M.: Une caract\u00e9risation des mots p\u00e9riodiques. C.R. Acad. Sci. Paris\u00a0286(A), 1175\u20131177 (1978)","journal-title":"C.R. Acad. Sci. Paris"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(92)90134-2","volume":"92","author":"M. Crochemore","year":"1992","unstructured":"Crochemore, M.: String-matching on ordered alphabets. Theoret. Comput. Sci.\u00a092, 33\u201347 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M., Perrin, D.: Two-way string-matching. J. Assoc. Comput. Mach.\u00a038(3), 651\u2013675 (1991)","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-1-4613-9323-8_12","volume-title":"Proc. of Sequences II: Methods in Communication, Security and Computer Science","author":"M. Crochemore","year":"1993","unstructured":"Crochemore, M., Rytter, W.: Periodic Prefixes in Texts. In: Capocelli, R., Santis, A.D., Vaccaro, U. (eds.) Proc. of Sequences II: Methods in Communication, Security and Computer Science, pp. 153\u2013165. Springer, Heidelberg (1993)"},{"key":"16_CR9","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"issue":"5","key":"16_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Sqares, Cubes, and Time-Space Efficient String Searching. Algorithmica\u00a013(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific, Singapore (2002)"},{"issue":"1-3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2004.06.024","volume":"326","author":"J.P. Duval","year":"2004","unstructured":"Duval, J.P., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-time computation of local periods. Theor. Comput. Sci.\u00a0326(1-3), 229\u2013240 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J. Duval","year":"1983","unstructured":"Duval, J.: Factorizing Words over an Ordered Alphabet. J. Algorithms\u00a04, 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ergun, F., Jowhari, H., Salgan, M.: Periodicity in Streams (2010) (manuscript)","DOI":"10.1007\/978-3-642-15369-3_41"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/322234.322244","volume":"28","author":"Z. Galil","year":"1981","unstructured":"Galil, Z.: String Matching in Real Time. J. Assoc. Comput. Mach.\u00a028(1), 134\u2013149 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1137\/0209032","volume":"2","author":"Z. Galil","year":"1980","unstructured":"Galil, Z., Seiferas, J.: Saving space in fast string-matching. SIAM J. Comput.\u00a02, 417\u2013438 (1980)","journal-title":"SIAM J. Comput."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0304-3975(81)80006-0","volume":"13","author":"Z. Galil","year":"1981","unstructured":"Galil, Z., Seiferas, J.: Linear-time string-matching using only a fixed number of local storage locations. Theoret. Comput. Sci.\u00a013, 331\u2013336 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.: Time-space-optimal string matching. J. Comput. System Sci.\u00a026, 280\u2013294 (1983)","journal-title":"J. Comput. System Sci."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-27801-6_9","volume-title":"Combinatorial Pattern Matching","author":"L. Gasieniec","year":"2004","unstructured":"Gasieniec, L., Kolpakov, R.M.: Real-time string matching in sublinear space. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 117\u2013129. Springer, Heidelberg (2004)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-60044-2_36","volume-title":"Combinatorial Pattern Matching","author":"L. Gasieniec","year":"1995","unstructured":"Gasieniec, L., Plandowski, W., Rytter, W.: Constant-space string matching with smaller number of comparisons: Sequential sampling. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 78\u201389. Springer, Heidelberg (1995)"},{"issue":"1&2","key":"16_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(94)00249-I","volume":"147","author":"L. Gasieniec","year":"1995","unstructured":"Gasieniec, L., Plandowski, W., Rytter, W.: The zooming method: A recursive approach to time-space efficient string-matching. Theor. Comput. Sci.\u00a0147(1&2), 19\u201330 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"16_CR22","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1006\/jcss.1996.0084","volume":"53","author":"T. Jiang","year":"1996","unstructured":"Jiang, T., Li, M.: K one-way heads cannot do string-matching. J. Comput. Syst. Sci.\u00a053(3), 513\u2013524 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"Karp, R., Rabin, M.: Efficient randomized pattern matching algorithms. IBM J. Res. Develop.\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Develop."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput.\u00a06, 322\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"16_CR25","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"key":"16_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact And Approxiamate Pattern Matching In The Streaming Model. In: Proc. 50th IEEE Symp. on Foundations of Computer Science, pp. 315\u2013323 (2009)","DOI":"10.1109\/FOCS.2009.11"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-45995-2_21","volume-title":"LATIN 2002: Theoretical Informatics","author":"W. Rytter","year":"2002","unstructured":"Rytter, W.: On maximal suffices and constant-space linear-time versions of kmp algorithm. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 196\u2013208. Springer, Heidelberg (2002)"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01768472","volume":"11","author":"J.I. Seiferas","year":"1977","unstructured":"Seiferas, J.I., Galil, Z.: Real-time recognition of substring repetition and reversal. Mathematical Systems Theory\u00a011, 111\u2013146 (1977)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T20:43:18Z","timestamp":1686170598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}