The following pages link to An improved equivalence algorithm (Q5337563):
Displayed 12 items.
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- Complexity of algorithm and operations on trees (Q688696) (← links)
- The slice algorithm for irreducible decomposition of monomial ideals (Q1008570) (← links)
- Word level bitwidth reduction for unbounded hardware model checking (Q1039855) (← links)
- The hybrid spanning tree problem (Q1333484) (← links)
- The recognition of union trees (Q2365813) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS (Q3434278) (← links)
- A partially persistent data structure for the set-union problem (Q3479514) (← links)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
- Amortized Computational Complexity (Q3735083) (← links)