{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:10:48Z","timestamp":1672690248368},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,7]]},"DOI":"10.1016\/0020-0190(79)90106-6","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"39-45","source":"Crossref","is-referenced-by-count":3,"title":["A new data structure for the union-find problem"],"prefix":"10.1016","volume":"9","author":[{"given":"Marek J.","family":"Lao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90106-6_BIB1","first-page":"253","article-title":"On computing least common ancestors in trees","author":"Aho","year":"1973","journal-title":"Proc. 5th Annual ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(79)90106-6_BIB2","series-title":"The Design and Analysis of Computer Algorithms","first-page":"124","author":"Aho","year":"1975"},{"issue":"7","key":"10.1016\/0020-0190(79)90106-6_BIB3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1145\/366622.366626","article-title":"An algorithm for equivalence declarations","volume":"4","author":"Arden","year":"1961","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(79)90106-6_BIB4","series-title":"Complexity of Computer Computations","first-page":"153","article-title":"Efficiency of equivalence algorithms","author":"Fischer","year":"1972"},{"key":"10.1016\/0020-0190(79)90106-6_BIB5","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0202024","article-title":"Set merging algorithms","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(79)90106-6_BIB6","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1145\/800193.569966","article-title":"Computing minimum spanning trees efficiently","author":"Kirschenbaum","year":"1972","journal-title":"Proc. 25th Annual Conf. of the ACM"},{"issue":"3","key":"10.1016\/0020-0190(79)90106-6_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","article-title":"The expected linearity of a simple equivalence algorithm","volume":"6","author":"Knuth","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(79)90106-6_BIB8","first-page":"118","article-title":"Table machine simulation","author":"Stearns","year":"1969","journal-title":"Proc. 10th Annual SWAT Conf."},{"issue":"2","key":"10.1016\/0020-0190(79)90106-6_BIB9","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. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079901066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:23:22Z","timestamp":1554906202000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079901066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0020019079901066"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90106-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}