Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Postorder disjoint set union is linear
SIAM Journal on Computing
Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
SIAM Journal on Computing
Optimal on-line decremental connectivity in trees
Information Processing Letters
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate predominators in a directed graph [H]
Communications of the ACM
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Algorithm for Finding NCA on Pure Pointer Machines
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Novel Probabilistic Data Flow Framework
CC '01 Proceedings of the 10th International Conference on Compiler Construction
Algorithms for computing the static single assignment form
Journal of the ACM (JACM)
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dominator tree verification and vertex-disjoint paths
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Theoretical Computer Science
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
A note on computing set overlap classes
Information Processing Letters
Optimal MST maintenance for transient deletion of every node in planar graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Research paper: The saga of minimum spanning trees
Computer Science Review
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |