{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:21:06Z","timestamp":1692710466128},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90119-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"57-70","source":"Crossref","is-referenced-by-count":8,"title":["Worst-case analysis of the set-union problem with extended backtracking"],"prefix":"10.1016","volume":"68","author":[{"given":"Giorgio","family":"Gambosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90119-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(89)90119-9_BIB2","first-page":"1259","article-title":"An algorithm for the organization of the information","volume":"3","author":"Adelson-Velskii","year":"1962","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(89)90119-9_BIB3","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/0215072","article-title":"On the single operation worst-case time complexity of the disjoint set union problem","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90119-9_BIB4","first-page":"224","article-title":"On the expected behaviour of disjoint set union problems","author":"Bollobas","year":"1985","journal-title":"Proc. 17th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90119-9_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indices","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(89)90119-9_BIB6","article-title":"A partially persistent data structure for the set-union problem","author":"Gaibisso","year":"1989","journal-title":"RAIRO\u2014Theoretical Informatics and Applications"},{"key":"10.1016\/0304-3975(89)90119-9_BIB7","first-page":"8","article-title":"Getting back to the past in the Union-Find problem","author":"Gambosi","year":"1988","journal-title":"5th Symp. on Theoretical Aspects of Computer Science"},{"key":"10.1016\/0304-3975(89)90119-9_BIB8","unstructured":"G. Gambosi, G.F. Italiano and M. Talamo, The Union-Find problem with dynamic weighted backtracking, Algorithmica, submitted."},{"key":"10.1016\/0304-3975(89)90119-9_BIB9","first-page":"246","article-title":"A linear time algorithm for a special case of disjoint set union","author":"Gabow","year":"1983","journal-title":"Proc. 15th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90119-9_BIB10","series-title":"Introduction to Logic Programming","author":"Hogger","year":"1984"},{"key":"10.1016\/0304-3975(89)90119-9_BIB11","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0202024","article-title":"Set merging algorithms","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90119-9_BIB12","first-page":"360","article-title":"Linearity and unprovability of set union problems","author":"Loebl","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90119-9_BIB13","first-page":"236","article-title":"The set union problem with backtracking","author":"Mannila","year":"1986","journal-title":"Proc. 13th ICALP"},{"key":"10.1016\/0304-3975(89)90119-9_BIB14","first-page":"122","article-title":"On the complexity of unification sequences","author":"Mannila","year":"1986","journal-title":"Proc. 3rd Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90119-9_BIB15","first-page":"479","article-title":"A lower bound for the complexity of the union-split-find problem","author":"Mehlhorn","year":"1987","journal-title":"Proc. 14th ICALP"},{"key":"10.1016\/0304-3975(89)90119-9_BIB16","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\/0304-3975(89)90119-9_BIB17","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0304-3975(89)90119-9_BIB18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithms","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90119-9_BIB19","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","article-title":"A class of algorithms which require nonlinear time to maintain disjoint sets","volume":"18","author":"Tarjan","year":"1979","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0304-3975(89)90119-9_BIB20","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Alg. Discr. Meth."},{"key":"10.1016\/0304-3975(89)90119-9_BIB21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","article-title":"Worst-case analysis of set union algorithms","volume":"31","author":"Tarjan","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90119-9_BIB22","series-title":"Tech. Rept. RUU-CS-77-3","article-title":"Alternative path compression techniques","author":"van Leeuwen","year":"1977"},{"key":"10.1016\/0304-3975(89)90119-9_BIB23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/872734.806939","article-title":"Prolog-the language and its implementation compared with LISP","volume":"12","author":"Warren","year":"1977","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0304-3975(89)90119-9_BIB24","series-title":"Tech. Rept. TR-103-87","article-title":"Amortized analysis of algorithms for set union with backtracking","author":"Westbrook","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:38Z","timestamp":1555127798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901199"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90119-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}