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)
An improved equivalence algorithm
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Self-adjusting binary search trees
Journal of the ACM (JACM)
The complexity of using forwarding addresses for decentralized object finding
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Memory coherence in shared virtual memory systems
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
On the expected behavior of disjoint set union algorithms
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
The physical mapping problem for parallel architectures
Journal of the ACM (JACM)
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Lower bounds for the union-find and the split-find problem on pointer machines
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fully dynamic algorithms for edge connectivity problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
Primitives for asynchronous list compression
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Finding connected components on a scan line array processor
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A new framework for elimination-based data flow analysis using DJ graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Texture mapping for cel animation
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unique maximum matching algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Purely functional, real-time deques with catenation
Journal of the ACM (JACM)
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Learning Function Distinguishable Regular Languages
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
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
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Multidimensional cell lists for investigating 3-manifolds
Discrete Applied Mathematics
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
Identification of function distinguishable languages
Theoretical Computer Science
An asymptotic study for path reversal
Theoretical Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Visualization in algorithm engineering: tools and techniques
Experimental algorithmics
Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fuzzy functional dependencies and Bayesian networks
Journal of Computer Science and Technology
A fuzzy approach to classification of text documents
Journal of Computer Science and Technology
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Asynchronous resource discovery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
ACM Transactions on Algorithms (TALG)
Size functions for comparing 3D models
Pattern Recognition
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Efficient nondestructive equality checking for trees and graphs
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Recent Advances in Constraints
From exponential to almost linear decomposability of finite or infinite trees
Proceedings of the 2009 ACM symposium on Applied Computing
Fast connected-component labeling
Pattern Recognition
Using model theory to specify AI programs
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Intersection reporting on two collections of disjoint sets
Information Sciences: an International Journal
Determination of maximally stable extremal regions in large images
SPPRA '08 Proceedings of the Fifth IASTED International Conference on Signal Processing, Pattern Recognition and Applications
An art gallery-based approach: roadmap construction and path planning in global environments
International Journal of Robotics and Automation
Complexity of a CHR solver for existentially quantified conjunctions of equations over trees
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Calibration and low-level data fusion algorithms for a parallel 2D/3D-camera
Information Fusion
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
A scalable parallel union-find algorithm for distributed memory computers
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Note: A simple and efficient Union-Find-Delete algorithm
Theoretical Computer Science
Efficiently mining co-location rules on interval data
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Automatically finding clusters in normalized cuts
Pattern Recognition
Constraint-based modeling and scheduling of clinical pathways
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Don't rush into a union: take time to find your roots
Proceedings of the forty-third annual ACM symposium on Theory of computing
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Union-find with constant time deletions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Experiments on union-find algorithms for the disjoint-set data structure
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Finding disjoint paths on directed acyclic graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Inference of well-typings for logic programs with application to termination analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
Fundamenta Informaticae
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
We know how you live: exploring the spectrum of urban lifestyles
Proceedings of the first ACM conference on Online social networks
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Finding dominators via disjoint set union
Journal of Discrete Algorithms
| Hi-index | 0.01 |