{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:19Z","timestamp":1725664099125},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:37:26Z","timestamp":1330270646000},"page":"302-313","source":"Crossref","is-referenced-by-count":0,"title":["Parallel dynamic lowest common ancestors"],"prefix":"10.1007","author":[{"given":"Eric","family":"Schenk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/0205011","volume":"5","author":"Alfred V. V. Aho","year":"1976","unstructured":"Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, On computing least common ancestors in trees, SIAM J. Comput. 5 (1976), 115\u2013132.","journal-title":"SIAM J. Comput."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Arne Andersson, Improving partial rebuilding by using simple balance criteria, Proceedings of the Workshop on Algorithms and Data Structures (F. Dehne, J.-R. Sack, and N. Santoro, eds.), Springer Verlag, 1989, pp. 393\u2013402.","DOI":"10.1007\/3-540-51542-9_33"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Omer Berkman and Uzi Vishkin, Recursive *-tree parallel data-structure, Proceedings of the 30th Annual IEEE Symposium on the Foundations of Computer Science, 1989, pp. 196\u2013202.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"28_CR4","unstructured":"Harold N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 434\u2013443."},{"issue":"no.2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Dov Harel and Robert Endre Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984), no. 2, 338\u2013355.","journal-title":"SIAM J. Comput."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Lisa Higham and Eric Schenk, PRAM memory allocation and initialization, Parallel Processing Letters 3 (1993), no. 3.","DOI":"10.1142\/S0129626493000332"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1137\/0211024","volume":"11","author":"J. J\u00e1J\u00e1","year":"1982","unstructured":"J. J\u00e1J\u00e1 and J. Simon, Parallel algorithms in graph theory: Planarity testing, SIAM J. Comput. 11 (1982), 314\u2013328.","journal-title":"SIAM J. Comput."},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1137\/0208048","volume":"8","author":"D. Maier","year":"1979","unstructured":"D. Maier, An efficient method for storing ancestor information in trees, SIAM J. Comput. 8 (1979), 559\u2013618.","journal-title":"SIAM J. Comput."},{"issue":"no.3","key":"28_CR9","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TSE.1986.6312885","volume":"SE-12","author":"A. Moitra","year":"1986","unstructured":"A. Moitra and S. S. Iyengar, Derivation of a parallel algorithm for balanced binary trees, IEEE Trans. Software Engrg. SE-12 (1986), no. 3, 442\u2013449.","journal-title":"IEEE Trans. Software Engrg."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"J. H. Reif, An optimal parallel algorithm for integer sorting, Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, 1985, pp. 335\u2013344.","DOI":"10.1109\/SFCS.1985.9"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:48Z","timestamp":1605647928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}