{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:13:15Z","timestamp":1784110395282,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"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":11004,"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":[[1983,6]]},"DOI":"10.1016\/0022-0000(83)90006-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"362-391","source":"Crossref","is-referenced-by-count":639,"title":["A data structure for dynamic trees"],"prefix":"10.1016","volume":"26","author":[{"given":"Daniel D.","family":"Sleator","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Endre Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90006-5_BIB1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/0205011","article-title":"On finding lowest common ancestors in trees","volume":"5","author":"Aho","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90006-5_BIB2","series-title":"Proc. Twenty-First Annual IEEE Symp. on Foundations of Computer Science","first-page":"248","article-title":"Biased 2\u20133 trees","author":"Bent","year":"1980"},{"key":"10.1016\/0022-0000(83)90006-5_BIB3","doi-asserted-by":"crossref","unstructured":"S. W. Bent, D. D. Sleator and R.E. Tarjan, \u201cBiased Search Trees\u201dSIAM J. Comput., to appear.","DOI":"10.1137\/0214041"},{"key":"10.1016\/0022-0000(83)90006-5_BIB4","series-title":"Linear Programming","author":"Chvatal","year":"1983"},{"key":"10.1016\/0022-0000(83)90006-5_BIB5","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0022-0000(83)90006-5_BIB6","first-page":"1277","article-title":"An algorithm for the solution of a problem of maximal flow in a network with power estimation","volume":"11","author":"Dinits","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(83)90006-5_BIB7","unstructured":"H. N. Gabow and R. E. Tarjan, Efficient algorithms for a family of matroid problems, J. Algorithms, to appear."},{"key":"10.1016\/0022-0000(83)90006-5_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0022-0000(80)90035-5","article-title":"An O(EV log2 V) algorithm for the maximal flow problem","volume":"21","author":"Galil","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90006-5_BIB9","series-title":"Proc. Nineteenth Annual IEEE Symp. on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0022-0000(83)90006-5_BIB10","doi-asserted-by":"crossref","unstructured":"D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., to appear.","DOI":"10.1137\/0213024"},{"key":"10.1016\/0022-0000(83)90006-5_BIB11","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(83)90006-5_BIB12","author":"Knuth","year":"1974"},{"key":"10.1016\/0022-0000(83)90006-5_BIB13","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1137\/0208048","article-title":"An efficient method for storing ancestor information in trees","volume":"8","author":"Maier","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90006-5_BIB14","first-page":"277","article-title":"An O(|V|3) algorithm for maximum flows in networks","volume":"7","author":"Malhotra","year":"1978"},{"key":"10.1016\/0022-0000(83)90006-5_BIB15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90006-5_BIB16","article-title":"An O(nI log2 I) Maximum-Flow Algorithm","author":"Shiloach","year":"1978"},{"key":"10.1016\/0022-0000(83)90006-5_BIB17","article-title":"An O(nm log n) Algorithm for Maximum Network Flow","author":"Sleator","year":"1980"},{"key":"10.1016\/0022-0000(83)90006-5_BIB18","series-title":"Proc. Thirteenth Annual ACM Symp. on Theory of Computing","first-page":"114","article-title":"A data structure for dynamic trees","author":"Sleator","year":"1981"},{"key":"10.1016\/0022-0000(83)90006-5_BIB19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90006-5_BIB20","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","article-title":"Applications of path compression on balanced trees","volume":"26","author":"Tarjan","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90006-5_BIB21","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan and J. van Leeuwen, Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., to appear.","DOI":"10.1145\/62.2160"},{"key":"10.1016\/0022-0000(83)90006-5_BIB22","series-title":"Proc. Fifteenth Annual ACM Symp. on Theory of Computing","first-page":"235","article-title":"Self-adjusting binary trees","author":"Sleator","year":"1983"},{"key":"10.1016\/0022-0000(83)90006-5_BIB23","unstructured":"R. E. Tarjan, \u201cData Structures and Network Algorithms,\u201d Society for Industrial and Applied Mathematics, Philadelphia, Penn., to appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900065?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900065?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:50:51Z","timestamp":1550325051000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["0022000083900065"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90006-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}