A partially persistent data structure for the set-union problem
From MaRDI portal
Recommendations
Cites work
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A linear-time algorithm for a special case of disjoint set union
- Amortized Analysis of Algorithms for Set Union with Backtracking
- Amortized Computational Complexity
- An improved equivalence algorithm
- Efficiency of a Good But Not Linear Set Union Algorithm
- scientific article; zbMATH DE number 3907792 (Why is no real title available?)
- scientific article; zbMATH DE number 3960991 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Making data structures persistent
- Set Merging Algorithms
- Worst-case Analysis of Set Union Algorithms
- Worst-case analysis of the set-union problem with extended backtracking
Cited in
(6)- Worst-case analysis of the set-union problem with extended backtracking
- A space efficient variant of path copying for partially persistent sorted sets
- scientific article; zbMATH DE number 1375590 (Why is no real title available?)
- scientific article; zbMATH DE number 177569 (Why is no real title available?)
- scientific article; zbMATH DE number 1973993 (Why is no real title available?)
- scientific article; zbMATH DE number 2065605 (Why is no real title available?)
This page was built for publication: A partially persistent data structure for the set-union problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479514)