{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:49Z","timestamp":1725484669518},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_26","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"263-277","source":"Crossref","is-referenced-by-count":3,"title":["Ancestor Problems on Pure Pointer Machines"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Pontelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Desh","family":"Ranjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jagm.2000.1079","volume":"35","author":"S. Alstrup","year":"2000","unstructured":"S. Alstrup and M. Thorup. Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. Journal of Algorithms, 35:169\u2013188, 2000.","journal-title":"Journal of Algorithms"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"A.M. Ben-Amram. What is a Pointer Machine? Tech. Rep., U. Copenhagen, 1995.","DOI":"10.1145\/202840.202846"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"M.A. Bender and M. Farach-Colton. The LCA Problem Revisited. In LATIN 2000, Springer Verlag, 2000.","DOI":"10.1007\/10719839_9"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"O. Berkman and U. Vishkin. Recursive *-tree Parallel Data-structure. In FOCS, IEEE Computer Society, 1989.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"26_CR5","unstructured":"R. Cole and R. Hariharan. Dynamic LCA Queries on Trees. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 235\u2013244. ACM\/SIAM, 1999."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"A. Dal Pal\u00fa, E. Pontelli, D. Ranjan. An Optimal Algorithm for Finding NCA on Pure Pointer Machines. Tech. Rep. NMSU-TR-CS-007\/2001, 2001.","DOI":"10.1007\/3-540-45471-3_44"},{"key":"26_CR7","unstructured":"H.N. Gabow. Data structures for weighted matching and nearest common ancestor. In ACM Symp. on Discrete Algorithms, pages 434\u2013443, 1990."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"G. Gupta, E. Pontelli, et al. Parallel Execution of Prolog Programs: a Survey. ACM TOPLAS, 2002. (to appear).","DOI":"10.1145\/504083.504085"},{"key":"26_CR9","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1999."},{"issue":"2","key":"26_CR10","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. Fast Algorithms for Finding Nearest Common Ancestor. SIAM Journal of Computing, 13(2):338\u2013355, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"26_CR11","unstructured":"D.E. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley, 1968."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"E. Pontelli, D. Ranjan, and G. Gupta. On the Complexity of Parallel Implementation of Logic Programs. In FSTTCS, 1997. Springer Verlag.","DOI":"10.1007\/BFb0058027"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/PL00013301","volume":"37","author":"D. Ranjan","year":"2000","unstructured":"D. Ranjan, E. Pontelli, and G. Gupta. Data Structures for Order-Sensitive Predicates in Parallel Nondetermistic Systems. ACTA Informatica, 37(1):21\u201343, 2000.","journal-title":"ACTA Informatica"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s004530010036","volume":"28","author":"D. Ranjan","year":"2000","unstructured":"D. Ranjan, E. Pontelli, L. Longpre, and G. Gupta. The Temporal Precedence Problem. Algorithmica, 28, 2000.","journal-title":"Algorithmica"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors. SIAM J. Computing, 17:1253\u20131262, 1988.","journal-title":"SIAM J. Computing"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF00268844","volume":"25","author":"A.K. Tsakalidis","year":"1988","unstructured":"A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree. ACTA Informatica, 25:37\u201354, 1988.","journal-title":"ACTA Informatica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T02:10:32Z","timestamp":1683857432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}