The following pages link to An improved equivalence algorithm (Q5337563):
Displaying 30 items.
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← 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)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Lock-free concurrent binomial heaps (Q1994357) (← links)
- Concurrent disjoint set union (Q2064053) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Lexicographic optimal homologous chains and applications to point cloud triangulations (Q2105327) (← links)
- Approximate verification of strategic abilities under imperfect information (Q2289016) (← links)
- Linking and cutting spanning trees (Q2331458) (← links)
- The recognition of union trees (Q2365813) (← links)
- A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434) (← links)
- Computing distributed knowledge as the greatest lower bound of knowledge (Q2695370) (← 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)
- Practical Minimum Cut Algorithms (Q4629534) (← links)
- Critical points of the random cluster model with Newman–Ziff sampling (Q5049521) (← links)
- (Q5091209) (← links)
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras (Q5098718) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- On the revealed preference analysis of stable aggregate matchings (Q6059562) (← links)
- (Q6089675) (← links)
