Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Introduction to logic programming
Introduction to logic programming
Data structures and network algorithms
Data structures and network algorithms
Login: A logic programming language with built-in inheritance
Journal of Logic Programming
On the complexity of unification sequences
Proceedings on Third international conference on logic programming
The set union problem with backtracking
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
On the single-operation worst-case time complexity of the disjoint set union problem
SIAM Journal on Computing
On the expected behavior of disjoint set union algorithms
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Dynamic orthogonal segment intersection search
Journal of Algorithms
A lower bound on the complexity of the union-split-find problem
SIAM Journal on Computing
Time parameter and arbitrary deunions in the set union problem
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Amortized analysis of algorithms for set union with backtracking
SIAM Journal on Computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Worst-case analysis of the set-union problem with extended backtracking
Theoretical Computer Science
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
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
A note on set union with arbitrary deunions
Information Processing Letters
Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
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 On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences
Communications of the ACM
An improved equivalence algorithm
Communications of the ACM
An algorithm for equivalence declarations
Communications of the ACM
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Computing minimum spanning trees efficiently
ACM '72 Proceedings of the ACM annual conference - Volume 1
Data Structures and Algorithms
Data Structures and Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Getting Back to the Past in the Union-Find Problem
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On finding lowest common ancestors in trees
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Prolog - the language and its implementation compared with Lisp
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Algorithms and data structures for dynamic graph problems
Algorithms and data structures for dynamic graph problems
Big Omicron and big Omega and big Theta
ACM SIGACT News
ACM SIGACT News
ACM Computing Surveys (CSUR)
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient Algorithms for Two Generalized 2-Median Problems on Trees
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
Binary equality implication constraints, normal forms and data redundancy
Information Processing Letters
Efficient nondestructive equality checking for trees and graphs
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A Hybrid Model for Immune Inspired Network Intrusion Detection
ICARIS '08 Proceedings of the 7th international conference on Artificial Immune Systems
A Segmentation-Based Approach for Approximate Query over Distributed Ontologies
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Recent Advances in Constraints
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Theoretical Computer Science
Anonymizing moving objects: how to hide a MOB in a crowd?
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
NURBS with extraordinary points: high-degree, non-uniform, rational subdivision schemes
ACM SIGGRAPH 2009 papers
Parallel programming with object assemblies
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Generating Reduced Tests for FSMs with Extra States
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Intersection reporting on two collections of disjoint sets
Information Sciences: an International Journal
Hit-list worm detection and bot identification in large networks using protocol graphs
RAID'07 Proceedings of the 10th international conference on Recent advances in intrusion detection
Optimized block-based connected components labeling with decision trees
IEEE Transactions on Image Processing
Speeding up Polyhedral Analysis by Identifying Common Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Trajectory anonymity in publishing personal mobility data
ACM SIGKDD Explorations Newsletter
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Stochastic coalescence in logarithmic time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Accelerating physics in large, continuous virtual environments
Concurrency and Computation: Practice & Experience
On reducing test length for FSMs with extra states
Software Testing, Verification & Reliability
Optimal decision trees for local image processing algorithms
Pattern Recognition Letters
| Hi-index | 0.00 |