An algorithm for equivalence declarations
Communications of the ACM
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
A note on relative neighborhood graphs
SCG '87 Proceedings of the third annual symposium on Computational geometry
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Abstract Implementations and Their Correctness Proofs
Journal of the ACM (JACM)
DITRAN—a compiler emphasizing diagnostics
Communications of the ACM
Distributed Searching of k-Dimensional Data with Almost Constant Costs
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Automating renormalization of quantum field theories
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Some Observations on Equivalence Handling Methods
IEEE Transactions on Computers
Efficient nondestructive equality checking for trees and graphs
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A Practical Approach to Word Level Model Checking of Industrial Netlists
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
The Slice Algorithm for irreducible decomposition of monomial ideals
Journal of Symbolic Computation
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Automated deduction for verification
ACM Computing Surveys (CSUR)
Word level bitwidth reduction for unbounded hardware model checking
Formal Methods in System Design
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
DiscFinder: a data-intensive scalable cluster finder for astrophysics
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Rapid simplification of multi-attribute meshes
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Visual memes in social media: tracking real-world news in YouTube videos
MM '11 Proceedings of the 19th ACM international conference on Multimedia
A new scalable parallel DBSCAN algorithm using the disjoint-set data structure
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Scalable parallel OPTICS data clustering using graph algorithmic techniques
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Optimal re-encryption strategy for joins in encrypted databases
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 48.24 |
An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented. The algorithm is based on a tree structure, and has reduced computation time by 40 percent over a previously published algorithm by identifying all equivalence classes with one scan of the EQUIVALENCE declarations. The method is applicable in any problem in which it is necessary to identify equivalence classes, given the element pairs defining the equivalence relation.