{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:13Z","timestamp":1725664273099},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:11:45Z","timestamp":1330269105000},"page":"136-145","source":"Crossref","is-referenced-by-count":0,"title":["Unit route upper bound for string-matching on hypercube"],"prefix":"10.1007","author":[{"given":"L.","family":"Lestr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"R.S. Boyer et J.S. Moore. A fast string searching algorithm. Comm of the ACM, 1977.","DOI":"10.1145\/359842.359859"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"D. Breslauer et Z. Galil. An optimal O(log log n) parallel string matching algorithm. SIAM J. Comput, 1990.","DOI":"10.1137\/0219072"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"D. Breslauer et Z. Galil. An lower bound for parallel string matching. In Proc. of the 23rd Ann ACM Symp on theory of computing, 1991.","DOI":"10.1145\/103418.103465"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"KL. Chung. A randomized parallel algorithm for string matching on hypercube. Pattern Recognition, 1992.","DOI":"10.1016\/0031-3203(92)90027-G"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"M. Crochemore et D. Perrin. Two-Way String-Matching. Journal of the ACM, Juillet 91.","DOI":"10.1145\/116825.116845"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"R. Cypher et C.G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. Proc of the 22nd Ann Symp on theory of computing, 1990.","DOI":"10.1145\/100216.100240"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Z. Galil. Optimal parallel algorithms for string matching. Inform. and Control, 1985.","DOI":"10.1016\/S0019-9958(85)80031-0"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Z. Galil. A constant-time Optimal Parallel string-matching algorithm. Proc of the 24th ACM symp. on Theory of Comput., 1992.","DOI":"10.1145\/129712.129720"},{"key":"12_CR9","unstructured":"A. Gibbons et W. Rytter. Efficient parallel algorithms. Cambridge University Press, 1988."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"R.M. Karp et M.O. Rabin. Efficient randomized pattern matching algorithms. IBM J. Res. Dev., 1987.","DOI":"10.1147\/rd.312.0249"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"D.E. Knuth, J.H. Morris et U.R. Pratt. Fast Pattern Matching in strings. SIAM J. Comput, 1977.","DOI":"10.1137\/0206024"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"D. Nassimi et S. Sahni. Data broadcasting in SIMD computers. IEEE Trans. on Comp, 1981.","DOI":"10.1109\/TC.1981.6312172"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"S. Ranka et S. Sahni. Hypercube Algorithms. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4613-9692-5"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"U. Vishkin. Optimal parallel pattern matching in strings. ICALP, 1985.","DOI":"10.1007\/BFb0015775"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"A. Wu. Embedding of tree networks into hypercubes. J. of Parallel and Distributed Computing, 1985.","DOI":"10.1016\/0743-7315(85)90026-7"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:53Z","timestamp":1605647813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}