Worst-case analysis of the set-union problem with extended backtracking (Q1124334): Difference between revisions

@@ Property / author @@
-Giuseppe F. Italiano
@@ Property / author: Giuseppe F. Italiano / rank @@
-Normal rank
@@ Property / author @@
+Giuseppe F. Italiano
@@ Property / author: Giuseppe F. Italiano / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59256059
@@ Property / Wikidata QID: Q59256059 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(89)90119-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1976070870
@@ Property / OpenAlex ID: W1976070870 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
+Normal rank
@@ Property / cites work @@
+Organization and maintenance of large ordered indexes
+Normal rank
@@ Property / cites work @@
+A partially persistent data structure for the set-union problem
+Normal rank
@@ Property / cites work @@
+Q3787478
@@ Property / cites work: Q3787478 / rank @@
+Normal rank
@@ Property / cites work @@
+The set union problem with dynamic weighted backtracking
+Normal rank
@@ Property / cites work @@
+Q3690195
@@ Property / cites work: Q3690195 / rank @@
+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 @@
+Q4721668
@@ Property / cites work: Q4721668 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3774943
@@ Property / cites work: Q3774943 / rank @@
+Normal rank
@@ Property / cites work @@
+Binary Search Trees of Bounded Balance
@@ Property / cites work: Binary Search Trees of Bounded Balance / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:1124334