An improved equivalence algorithm
From MaRDI portal
Cited in
(37)- The slice algorithm for irreducible decomposition of monomial ideals
- Word level bitwidth reduction for unbounded hardware model checking
- The hybrid spanning tree problem
- Recognizing union-find trees is NP-complete
- Conditional congruence closure over uninterpreted and interpreted symbols
- Lock-free concurrent binomial heaps
- Concurrent disjoint set union
- Range minimum queries in minimal space
- Lexicographic optimal homologous chains and applications to point cloud triangulations
- Approximate verification of strategic abilities under imperfect information
- Linking and cutting spanning trees
- The recognition of union trees
- A heuristic approach to the treedepth decomposition problem for large graphs
- Computing distributed knowledge as the greatest lower bound of knowledge
- Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
- A partially persistent data structure for the set-union problem
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Amortized Computational Complexity
- Practical minimum cut algorithms
- Critical points of the random cluster model with Newman–Ziff sampling
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- Recognizing union-find trees is NP-complete, even without rank info
- A class of algorithms which require nonlinear time to maintain disjoint sets
- On the revealed preference analysis of stable aggregate matchings
- scientific article; zbMATH DE number 7764118 (Why is no real title available?)
- On efficient algorithms for bottleneck path problems with many sources
- Relation-algebraic verification of disjoint-set forests
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Filling gaps in the boundary of a polyhedron
- Lexicographic optimal chains and critical bases
- The obnoxious facilities p-center problem with forbidden regions
- Simplified and verified: a second look at a proof-producing union-find algorithm
- Complexity of algorithm and operations on trees
- Computing finite index congruences of finitely presented semigroups and monoids
- Relational Disjoint-Set Forests
This page was built for publication: An improved equivalence algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5337563)
