{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:05Z","timestamp":1725663485851},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518594"},{"type":"electronic","value":"9783540468318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51859-2_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:19:01Z","timestamp":1330204741000},"page":"25-32","source":"Crossref","is-referenced-by-count":1,"title":["PRAM algorithms for identifying polygon similarity"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"W. F.","family":"Smyth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(78)90073-X","volume":"7\u20133","author":"A. G. Akl","year":"1978","unstructured":"Akl, A. G., Toussaint, G. T., An improved algorithmic check for polygon similarity, Inf. Proc. Lett., 7\u20133 (1978) 127\u2013128","journal-title":"Inf. Proc. Lett."},{"key":"4_CR2","unstructured":"Apostolico A., Iliopoulos, C., Unpublished manuscript."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"Apostolico, A., Iliopoulos, C., Landau, G.M., Schieber, B., Vishkin, U., Parallel construction of a suffix tree with applications,Acta Algorithmica (1988)3: 347\u2013365","journal-title":"Acta Algorithmica"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Iliopoulos, C.S., Paige, R., An O(nlogn) cost parallel algorithm for the one function partitioning problem, Proc. of Int. Conf. on Parallel architectures, ed.Jung and Mehlhorn, Academie-Verlag, (1987) pp70\u201376","DOI":"10.1007\/3-540-18099-0_30"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"K.S. Booth","year":"1980","unstructured":"Booth, K.S., Lexicographically least circular substrings, Inf. Proc. Letters, 10, 4, (1980) pp240\u2013242","journal-title":"Inf. Proc. Letters"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V., Fast pattern maching in strings, SIAM J. Computing, 6 (2) (1977) pp 323\u2013350","journal-title":"SIAM J. Computing"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Fast canonization of circular strings, J. Algorithms 2 (1981) 107\u2013121","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Optimal Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51859-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:06Z","timestamp":1605648186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51859-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518594","9783540468318"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-51859-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}