{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:00Z","timestamp":1770994140875,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662460771","type":"print"},{"value":"9783662460788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_24","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"289-301","source":"Crossref","is-referenced-by-count":9,"title":["Pal k is Linear Recognizable Online"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Kosolobov","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Rubinchik","sequence":"additional","affiliation":[]},{"given":"Arseny M.","family":"Shur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Arlazarov, V., Dinic, E., Kronrod, M., Faradzev, I.: On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk.\u00a0194(11), 1209\u20131210 (1970) (in Russian)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-60044-2_32","volume-title":"Combinatorial Pattern Matching","author":"D. Breslauer","year":"1995","unstructured":"Breslauer, D.: Efficient String Matching on Coded Texts. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 27\u201340. Springer, Heidelberg (1995)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publ. (2002)","DOI":"10.1142\/4838"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M. Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica\u00a013(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jda.2014.08.001","volume":"28","author":"G. Fici","year":"2014","unstructured":"Fici, G., Gagie, T., K\u00e4rkk\u00e4inen, J., Kempa, D.: A Subquadratic Algorithm for Minimum Palindromic Factorization. J. Discrete Algorithms\u00a028, 41\u201348 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/322047.322056","volume":"25","author":"Z. Galil","year":"1978","unstructured":"Galil, Z., Seiferas, J.: A Linear-Time On-Line Recognition Algorithm for \u201cPalstar\u201d. J. ACM\u00a025(1), 102\u2013111 (1978)","journal-title":"J. ACM"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A. Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. European J. Combinatorics\u00a030(2), 510\u2013531 (2009)","journal-title":"European J. Combinatorics"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"24_CR9","unstructured":"Kosolobov, D., Rubinchik, M., Shur, A.M.: Finding Distinct Subpalindromes Online. In: Proc. Prague Stringology Conference, pp. 63\u201369 (2013)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Kosolobov, D., Rubinchik, M., Shur, A.M.: Palk Is Linear Recognizable Online. CoRR, arXiv:1404.5244.v2 [cs.FL] (2014)","DOI":"10.1007\/978-3-662-46078-8_24"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/505241.505242","volume":"49","author":"L. Lee","year":"2002","unstructured":"Lee, L.: Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM\u00a049(1), 1\u201315 (2002)","journal-title":"J. ACM"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G. Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time on-line algorithm finding the smallest initial palindrome of a string. J. ACM\u00a022(3), 346\u2013351 (1975)","journal-title":"J. ACM"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: General context-free recognition in less than cubic time. Journal of Computer and System Sciences\u00a010(2), 308\u2013314 (1975)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:59:19Z","timestamp":1559087959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}