{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:34:31Z","timestamp":1648848871597},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0020-0190(82)90105-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"47-52","source":"Crossref","is-referenced-by-count":3,"title":["Steady-paced-output and fractional-on-line algorithms on a ram"],"prefix":"10.1016","volume":"15","author":[{"given":"Glenn K.","family":"Manacher","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90105-3_BIB1","first-page":"335","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(82)90105-3_BIB2","first-page":"161","article-title":"Real-time algorithms for string-matching and palindrome recognition","author":"Galil","year":"1976","journal-title":"Proc. 8 Ann. ACM Symp. on the Theory of Computing"},{"issue":"1","key":"10.1016\/0020-0190(82)90105-3_BIB3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/322047.322056","article-title":"A linear-time recognition algorithm for \u2018Palstar\u2019","volume":"25","author":"Galil","year":"1978","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0020-0190(82)90105-3_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356635.356640","article-title":"Structured programming with \u2018go to\u2019 statements","volume":"6","author":"Knuth","year":"1974","journal-title":"ACM Comput. Surveys"},{"issue":"2","key":"10.1016\/0020-0190(82)90105-3_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0020-0190(82)90105-3_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/321892.321896","article-title":"A new linear-time \u2018on-line\u2019 algorithm for finding the smallest initial palindrome of a string","volume":"22","author":"Manacher","year":"1975","journal-title":"J. ACM"},{"issue":"7","key":"10.1016\/0020-0190(82)90105-3_BIB7","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","article-title":"An optimal real-time algorithm for planar convex hulls","volume":"22","author":"Preparata","year":"1979","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082901053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082901053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:39Z","timestamp":1555088079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082901053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0020019082901053"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90105-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}