{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:12:51Z","timestamp":1672261971106},"reference-count":16,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1990]]},"DOI":"10.1051\/ita\/1990240201891","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:58:01Z","timestamp":1486047481000},"page":"189-202","source":"Crossref","is-referenced-by-count":2,"title":["A partially persistent data structure for the set-union problem"],"prefix":"10.1051","volume":"24","author":[{"given":"C.","family":"Gaibisso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Gambosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.4135920326.68005"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BLUM N., On the Single Operation Worst-case Time Complexity of the Disjoint Set Union problem, Proc. 2nd Symp. on Theoretical Aspects of Computer Science, 1985.7868660568.68055","DOI":"10.1007\/BFb0023992"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BOLLOBAS B. and SIMON I., On the Expected Behavior of Disjoint Set Union Algorithms, Proc. 17th ACM Symp. on Theory of Computing, 1985.","DOI":"10.1145\/22145.22171"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. DRISCOLL J. R., SARNAK N., SLEATOR D. D. and TARJAN R. E., Making Data Structures Persistent, Proc. 18th Symp. on Theory of Computing STOC, 1986.0667.68026","DOI":"10.1145\/12130.12142"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. FISCHER M. J., Efficiency of Equivalence Algorithms, in Complexity of Computations, R. E. MILLER and J. W. THATCHER Eds., Plenum Press, New York, 1972.395316","DOI":"10.1007\/978-1-4684-2001-2_14"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. GABOW H. N. and TARJAN R. E., A Linear Time Algorithm for a Special case of Disjoint Set Union, Proc. 15th A.C.M. Symp. on Theory of Computing 1983.0572.68058","DOI":"10.1145\/800061.808753"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. GALLER B. A. and FISCHER M. J., An Improved Equivalence Algorithm, Comm. ACM 7, 1964.0129.10302","DOI":"10.1145\/355586.364830"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. GAMBOSI G., ITALIANO G. F. and TALAMO M., Worst-Case Analysis of the Set Union Problem with Backtracking, to appear on \"Theoretical Computer Science\", 1989.0678.68035","DOI":"10.1016\/0304-3975(89)90119-9"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. HOPCROFT J. E. and ULLMAN J. D., Set Merging Algorithms, S.I.A.M. J. Comput., 2, 1973.3293100253.68003","DOI":"10.1137\/0202024"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. MANNILA H. and UKKONEN E., The Set Union Problem with Backtracking, Proc. 13th I.C.A.L.P., 1986.8646860596.68039","DOI":"10.1007\/3-540-16761-7_73"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. TARJAN R. E., Efficiency of a Good but not Linear Disjoint Set Union Algorithm, J. A.C.M., 22, 1975.4589960307.68029","DOI":"10.1145\/321879.321884"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. TARJAN R. E., A Class of Algorithms which Require Linear Time to Mantain Disjoint Sets, J. Computer and System Sciences, 18, 1979.5321710413.68039","DOI":"10.1016\/0022-0000(79)90042-4"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. TARJAN R. E., Amortized Computational Complexity, S.I.A.M. J. Alg. Discr. Meth., 6, 1985.7780120599.68046","DOI":"10.1137\/0606031"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. TARJAN R. E. and VAN LEEUWEN J., Worst-Case Analysis of Set Union Algorithms, J. A.C.M. 31, 1984.8191380632.68043","DOI":"10.1145\/62.2160"},{"key":"R15","unstructured":"15. VAN LEEUWEN J. and VAN DER WEIDE T., Alternative Path Compression Techniques, Techn. Rep. RUU-CS-77-3, Rijksuniversiteit Utrecht, The Netherlands."},{"key":"R16","unstructured":"16. WESTBROOK J. and TARJAN R. E., Amortized Analysis of Algorithms for Set-Union with Backtracking, Tech. Rep. TR-103-87, Dept. of Computer Science, Princeton University, 1987.0679.68039"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1990240201891\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:56:10Z","timestamp":1568786170000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1990240201891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"references-count":16,"journal-issue":{"issue":"2"},"alternative-id":["ita1990240201891"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1990240201891","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}