{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:23:58Z","timestamp":1777965838060,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7047,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/s0022-0000(05)80002-9","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"214-230","source":"Crossref","is-referenced-by-count":62,"title":["Finding level-ancestors in trees"],"prefix":"10.1016","volume":"48","author":[{"given":"Omer","family":"Berkman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80002-9_bib1","series-title":"3rd Aegean Workshop on Computing","first-page":"81","article-title":"Deterministic parallel list ranking","volume":"Vol. 319","author":"Anderson","year":"1988"},{"key":"10.1016\/S0022-0000(05)80002-9_bib2","article-title":"Some Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values","author":"Berkman","year":"1988"},{"key":"10.1016\/S0022-0000(05)80002-9_bib3","series-title":"Proceedings, 30th IEEE Annual Symp. on Foundation of Computer Science","first-page":"196","article-title":"Recursive *-tree parallel data-structure","author":"Berkman","year":"1989"},{"key":"10.1016\/S0022-0000(05)80002-9_bib4","doi-asserted-by":"crossref","DOI":"10.21236\/ADA227803","article-title":"Recursive *-tree Parallel Data-Structure","author":"Berkman","year":"1990"},{"key":"10.1016\/S0022-0000(05)80002-9_bib5","article-title":"Almost Fully-Parallel Parentheses Matching","author":"Berkman","year":"1991"},{"key":"10.1016\/S0022-0000(05)80002-9_bib6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01840366","article-title":"Computing on a free tree via complexity-preserving mappings","volume":"2","author":"Chazelle","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(05)80002-9_bib7","series-title":"Proceedings, 27th IEEE Annual Symp. on Foundation of Computer Science","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986"},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80002-9_bib8","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80002-9_bib9","series-title":"Finding level-ancestors in dinamic trees, manuscript","author":"Dietz","year":"1991"},{"key":"10.1016\/S0022-0000(05)80002-9_bib10","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between concurrent-write models of parallel computation","volume":"1","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80002-9_bib11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80002-9_bib12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80002-9_bib13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(90)90155-Q","article-title":"Recognizing breadth-first search trees in linear time","volume":"34","author":"Manber","year":"1990","journal-title":"Inform. Process. Lett."},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80002-9_bib14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/355656.355657","article-title":"Parallel tridiagonal equation solvers","volume":"1","author":"Stone","year":"1975","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0022-0000(05)80002-9_bib15","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"issue":"No. 6","key":"10.1016\/S0022-0000(05)80002-9_bib16","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80002-9_bib17","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel, biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80002-9_bib18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","article-title":"On efficient parallel strong orientation","volume":"20","author":"Vishkin","year":"1985","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T16:39:56Z","timestamp":1552840796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["S0022000005800029"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80002-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}