An improved equivalence algorithm
From MaRDI portal
Publication:5337563
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
Related Items
A class of algorithms which require nonlinear time to maintain disjoint sets, 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, The recognition of union trees, 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