{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:55:04Z","timestamp":1747810504794},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387968186"},{"type":"electronic","value":"9780387347707"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988]]},"DOI":"10.1007\/bfb0040379","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"111-123","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On finding lowest common ancestors: Simplification and parallelization"],"prefix":"10.1007","author":[{"given":"Baruch","family":"Schieber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"12_CR2","unstructured":"A. Apostolico, C. Iliopoulos, G.M. Landau, B. Schieber and U. Vishkin, \u201cParallel construction of a suffix tree with applications\u201d, to appear in Algorithmica special issue on parallel and distributed computing."},{"key":"12_CR3","unstructured":"R. Cole and U. Vishkin, \u201cApproximate and exact parallel scheduling with applications to list, tree and graph problems\u201d, Proc. 27th Annual Symp. on Foundations of Computer Science, (1986), pp. 478\u2013491."},{"key":"12_CR4","unstructured":"R. Cole and U. Vishkin, \u201cFaster optimal parallel prefix sums and list ranking\u201d, TR 56\/86, the Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1986)."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, \u201cFast algorithms for finding nearest common ancestors\u201d, SIAM J. Comput., 13 (1984), pp. 338\u2013355.","journal-title":"SIAM J. Comput."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"G.M. Landau and U. Vishkin, \u201cIntroducing efficient parallelism into approximate string matching\u201d, Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 220\u2013230.","DOI":"10.1145\/12130.12152"},{"key":"12_CR7","unstructured":"G.M. Landau, B. Schieber and U. Vishkin, \u201cParallel construction of a suffix tree\u201d, Proc. 14th Int. Colloq. on Automata Lang. and Prog., Lecture Notes in Computer Science 267, Springer-Verlag (1987), pp. 314\u2013325."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber and U. Vishkin, \u201cParallel ear decomposition search (EDS) and st-numbering in graphs\u201d, Theoretical Computer Science, 47 (1986), pp. 277\u2013298.","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","unstructured":"B. Schieber and U. Vishkin, \u201cOn finding lowest common ancestors: simplification and parallelization\u201d, to appear in SIAM J. Comput., also TR 63\/87, the Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1987)."},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/TC.1986.1676830","volume":"C-35","author":"Y.H. Tsin","year":"1986","unstructured":"Y.H. Tsin, \u201cFinding lowest common ancestors in parallel\u201d, IEEE Tran. Comput. C-35 (1986), pp. 764\u2013769.","journal-title":"IEEE Tran. Comput."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan and U. Vishkin, \u201cAn efficient parallel biconnectivity algorithm\u201d, SIAM J. Comput. 14 (1985), pp. 862\u2013874.","journal-title":"SIAM J. Comput."},{"key":"12_CR12","unstructured":"U. Vishkin, \u201cSynchronous parallel computation \u2014 a survey\u201d, TR-71, Dept. of Computer Science, Courant Institute, NYU, (1983)."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","volume":"20","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin, \u201cOn efficient parallel strong orientation\u201d, Information Proc. Letters 20 (1985), pp. 235\u2013240.","journal-title":"Information Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T20:52:22Z","timestamp":1578516742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040379"}},"subtitle":["Extended summary"],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780387968186","9780387347707"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0040379","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}