{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:06Z","timestamp":1725456246599},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015933","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:25:05Z","timestamp":1132727105000},"page":"128-135","source":"Crossref","is-referenced-by-count":0,"title":["A partially persistent data structure for the set-union problem with backtracking"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Gaibisso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, \u201cThe Design and Analysis of Computer Algorithms\u201d, Addison-Wesley (1974)."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"N. Blum, \u201cOn the Single Operation Worst Case Time Complexity of the Disjoint Set-Union Problem\u201d, Proc. 2nd Symp. on Theretical Aspects of Computer Science (1985).","DOI":"10.1007\/BFb0023992"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollobas, I. Simon, \u201cOn the Expected Behavior of Disjoint Set-Union Algorithms\u201d, Proc. 17th ACM Symp. on Theory of Computing (1985).","DOI":"10.1145\/22145.22171"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"J.R. Driscoll, N. Sarnak, D.D. Sleator, R.E. Tarjan, \u201cMaking Data Structures Persistent\u201d, Proc. 18th Symp. on Theory of Computing STOC (1986).","DOI":"10.1145\/12130.12142"},{"key":"11_CR5","volume-title":"Complexity of Computations","author":"M.J. Fischer","year":"1972","unstructured":"M.J. Fischer, \u201cEfficiency of Equivalence Algorithms\u201d, in Complexity of Computations, R.E. Miller and J.W. Thatcher, eds., Plenum Press, New York (1972)."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, R.E. Tarjan, \u201cA Linear Time Algorithm for a Special Case of Disjoint Set-Union\u201d, Proc. 15th ACM Symp. on Theory of Computing (1983).","DOI":"10.1145\/800061.808753"},{"key":"11_CR7","unstructured":"C. Gaibisso, G. Gambosi, M. Talamo, \u201cA Partially Persistent Data Structure for the Set-Union Problem\u201d, submitted to RAIRO Theoretical Informatics and Applications (1987)."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"B.A. Galler, M.J. Fischer, \u201cAn Improved Equivalence Algorithm\u201d, Comm. ACM 7 (1964).","DOI":"10.1145\/355586.364830"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"G. Gambosi, G.F. Italiano. M. Talamo, \u201cWorst Case Analysis of the Set-Union Problem with Backtracking\u201d, to appear on \u201cTheoretical Computer Science\u201d (1988).","DOI":"10.1016\/0304-3975(89)90119-9"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft, J.D. Ullman, \u201cSet Merging Algorithms\u201d, SIAM J. Comput. 2 (1973).","DOI":"10.1137\/0202024"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"H. Mannila, E. Ukkonen, \u201cThe Set-Union Problem with Backtracking\u201d, Proc. 13th ICALP (1986).","DOI":"10.1007\/3-540-16761-7_73"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \u201cEfficiency of a Good but not Linear Disjoint Set-Union Algorithm\u201d, J. ACM 22 (1975).","DOI":"10.1145\/321879.321884"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \u201cA Class of Algorithms which Require Linear Time To Maintain Disjoint Sets\u201d, J. Computer and System Sciences 18 (1979).","DOI":"10.1016\/0022-0000(79)90042-4"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \u201cAmortized Computational Complexity\u201d, SIAM J. Alg. Discr. Meth. 6 (1985).","DOI":"10.1137\/0606031"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, J. van Leeuwen, \u201cWorst Case Analysis of Set-Union Algorithms\u201d, J. ACM 31 (1984).","DOI":"10.1145\/62.2160"},{"key":"11_CR16","unstructured":"J. van Leeuwen, T. van der Weide, \u201cAlternative Path Compression Techniques\u201d, Techn. Rep. RUU-CS-77-3, Rijksuniversiteit Utrecht, The Netherlands"},{"key":"11_CR17","unstructured":"J. Westbrook, R.E. Tarjan, \u201cAmortized Analysis of Algorithms for Set-Union with Backtracking\u201d, Tech. Rep. TR-103-87, Dept. of Computer Sciences, Princeton University (1987)."}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:25:57Z","timestamp":1586579157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0015933","relation":{},"subject":[]}}