An improved equivalence algorithm

DOI10.1145/364099.364331zbMath0129.10302WikidataQ56454024 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

zbMATH Keywords

numerical analysis

Related Items

Practical Minimum Cut Algorithms, Unnamed Item, Critical points of the random cluster model with Newman–Ziff sampling, 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, 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, Complexity of algorithm and operations on trees, 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, 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