{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:29Z","timestamp":1759638569529},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028247","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"32-40","source":"Crossref","is-referenced-by-count":17,"title":["Finding level-ancestors in dynamic trees"],"prefix":"10.1007","author":[{"given":"Paul F.","family":"Dietz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(84)80015-7","volume":"63","author":"M. Ajtai","year":"1984","unstructured":"M. Ajtai, M. Fredman, and J. Koml\u00f3s. Hash functions for priority queues. Information and Control, 63(3):217\u2013225, December 1984.","journal-title":"Information and Control"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Omer Berkman and Uzi Vishkin. Recursive *-tree parallel data-structure. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 196\u2013202, October 1989.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"4_CR3","unstructured":"Omer Berkman and Uzi Vishkin. Finding level-ancestors in trees. Technical Report UMIACSTR-91-9, Institute for Advanced Computer Studies, U. of Maryland, January 1991."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Michael L. Fredman and Dan E. Willard. Blasting through the information theoretic barrier with fusion trees. In Proc. 22nd ACM STOC, pages 1\u20137, May 1990.","DOI":"10.1145\/100216.100217"},{"key":"4_CR5","unstructured":"Harold N. Gabow. Data structures for weighted matching and nearest common ancestor. Technical Report CU-CS-478-90, U. of Colorado at Boulder, Department of Computer Science, June 1990. An earlier version was presented at the 1990 Symp. on Discrete Algorithm."},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","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 ancestors. SIAM J. On Computing, 13(2):338\u2013355, 1984.","journal-title":"SIAM J. On Computing"},{"issue":"4","key":"4_CR7","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"E. T. Robert","year":"1979","unstructured":"Robert E. Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690\u2013715, Oct. 1979.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028247.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:29Z","timestamp":1607551109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0028247","relation":{},"subject":[]}}