{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:13Z","timestamp":1725664573106},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61626-8_110","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:05:09Z","timestamp":1330293909000},"page":"832-835","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed string matching algorithm on the N-cube"],"prefix":"10.1007","author":[{"given":"Fouzia","family":"Moussouni","sequence":"first","affiliation":[]},{"given":"Christian","family":"Lavault","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus and L. Gasieniec. Optimal pattern matching on meshes. In 11th Ann. Symp. on Theoretical Aspects of Computer Science, pages 213\u2013224, 1994.","DOI":"10.1007\/3-540-57785-8_143"},{"key":"110_CR2","doi-asserted-by":"crossref","unstructured":"A. Czumaj, Z. Galil, L. Gasieniec, K. Park, and W. Plandowski. Work-time optimal parallel algorithms for strings problems. Manuscript, 1994.","DOI":"10.1145\/225058.225289"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, G.M. Landau, and K.V. Palem. Optimal parallel suffix-prefix matching algorithm and applications. In ACM Symposium on Parallel Algorithms and Architectures, pages 388\u2013398, 1989.","DOI":"10.1145\/72935.72977"},{"key":"110_CR4","doi-asserted-by":"crossref","unstructured":"D.K. Kim and K. Park. String matching in hypertext. In 6th Annuel Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, pages 318\u2013329, 1995.","DOI":"10.1007\/3-540-60044-2_51"},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"C. Lavault and F. Moussouni. N-cube string matching algorithm with long texts. In The Proceeding of CCS'95, Combinatorics and Computer Science, To appear in Lecture Notes in Computer Science, 1995.","DOI":"10.1007\/3-540-61576-8_93"},{"key":"110_CR6","doi-asserted-by":"publisher","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"},{"key":"110_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/0220002","volume":"20","author":"U. Vishkin","year":"1991","unstructured":"U. Vishkin. Deterministic sampling \u2014 a new technique for fast pattern matching. SIAM J.Comput, 20:22\u201340, 1991.","journal-title":"SIAM J.Comput"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:22:28Z","timestamp":1587342148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}