An improved equivalence algorithm
From MaRDI portal
Publication:5337563
DOI10.1145/364099.364331zbMath0129.10302OpenAlexW2022132320WikidataQ56454024 ScholiaQ56454024MaRDI QIDQ5337563
Michael J. Fisher, Bernard Galler
Publication date: 1964
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/364099.364331
Related Items (30)
The hybrid spanning tree problem ⋮ The recognition of union trees ⋮ Critical points of the random cluster model with Newman–Ziff sampling ⋮ Amortized Computational Complexity ⋮ A partially persistent data structure for the set-union problem ⋮ A class of algorithms which require nonlinear time to maintain disjoint sets ⋮ Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation ⋮ A heuristic approach to the treedepth decomposition problem for large graphs ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Recognizing union-find trees is NP-complete ⋮ On the revealed preference analysis of stable aggregate matchings ⋮ Computing distributed knowledge as the greatest lower bound of knowledge ⋮ Unnamed Item ⋮ Practical Minimum Cut Algorithms ⋮ Conditional congruence closure over uninterpreted and interpreted symbols ⋮ 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 ⋮ Lock-free concurrent binomial heaps ⋮ Complexity of algorithm and operations on trees ⋮ Unnamed Item ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info ⋮ Approximate verification of strategic abilities under imperfect information ⋮ The slice algorithm for irreducible decomposition of monomial ideals ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Concurrent disjoint set union ⋮ Word level bitwidth reduction for unbounded hardware model checking ⋮ Range minimum queries in minimal space ⋮ Linking and cutting spanning trees ⋮ ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS ⋮ Lexicographic optimal homologous chains and applications to point cloud triangulations
This page was built for publication: An improved equivalence algorithm
