A partially persistent data structure for the set-union problem (Q3479514): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3685219
@@ Property / cites work: Q3685219 / rank @@
+Normal rank
@@ Property / cites work @@
+Making data structures persistent
@@ Property / cites work: Making data structures persistent / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+An improved equivalence algorithm
@@ Property / cites work: An improved equivalence algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of the set-union problem with extended backtracking
+Normal rank
@@ Property / cites work @@
+Set Merging Algorithms
@@ Property / cites work: Set Merging Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3730015
@@ Property / cites work: Q3730015 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+A class of algorithms which require nonlinear time to maintain disjoint sets
+Normal rank
@@ Property / cites work @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case Analysis of Set Union Algorithms
@@ Property / cites work: Worst-case Analysis of Set Union Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Analysis of Algorithms for Set Union with Backtracking
+Normal rank