{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T08:21:31Z","timestamp":1709367691370},"reference-count":3,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1977,12]]},"DOI":"10.1137\/0206048","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T10:59:55Z","timestamp":1109242795000},"page":"669-674","source":"Crossref","is-referenced-by-count":49,"title":["On the Worst-Case Behavior of String-Searching Algorithms"],"prefix":"10.1137","volume":"6","author":[{"given":"Ronald L.","family":"Rivest","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"R2","first-page":"36","volume-title":"Computer algorithms","author":"Boyer Robert S.","year":"1994"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0206048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:18:07Z","timestamp":1485710287000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0206048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["10.1137\/0206048"],"URL":"https:\/\/doi.org\/10.1137\/0206048","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}