The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
An improved equivalence algorithm
Communications of the ACM
An algorithm for equivalence declarations
Communications of the ACM
Application of lattice algebra to loop optimization
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Node listings applied to data flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Applications of path compression on balanced trees.
Applications of path compression on balanced trees.
Solving path problems on directed graphs.
Solving path problems on directed graphs.
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
Elimination algorithms for data flow analysis
ACM Computing Surveys (CSUR)
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Optimal code motion: theory and practice
ACM Transactions on Programming Languages and Systems (TOPLAS)
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Efficiently computing Φ-nodes on-the-fly
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient building and placing of gating functions
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
The power of assignment motion
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Yet another efficient algorithm for replacing the edges of a minimum spanning tree
CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Efficient detection of determinacy races in Cilk programs
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On the complexity of escape analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Escape analysis: correctness proof, implementation and experimental results
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Detecting data races in Cilk programs that use locks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Matroid decomposition methods for the set maxima problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Identifying loops in almost linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient algorithms for generalized cut trees
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel
IEEE Transactions on Parallel and Distributed Systems
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient computation of flow insensitive interprocedural summary information
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Summarizing graphs by regular expressions
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On loops, dominators, and dominance frontiers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Certification of Computational Results
IEEE Transactions on Computers
Trade-offs in non-reversing diameter
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Detection of Races and Control-Flow Nondeterminism
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A data structure for dynamic trees
STOC '81 Proceedings of the thirteenth 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
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Approximate string matching on Ziv-Lempel compressed text
Journal of Discrete Algorithms
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGPLAN Notices - Best of PLDI 1979-1999
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Corrigendum: a new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dominator tree verification and vertex-disjoint paths
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing
The "Not-Too-Heavy Spanning Tree" Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Path Minima in Incremental Unrooted Trees
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Optimal interprocedural program optimization: a new framework and its application
Optimal interprocedural program optimization: a new framework and its application
Interacting code motion transformations: their impact and their complexity
Interacting code motion transformations: their impact and their complexity
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 new elimination-based data flow analysis framework using annotated decomposition trees
CC'07 Proceedings of the 16th international conference on Compiler construction
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithms and theory of computation handbook
Balancing degree, diameter and weight in Euclidean spanners
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Path minima queries in dynamic weighted trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The minimum spanning tree constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
LCA queries in directed acyclic graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An optimal-time construction of sparse Euclidean spanners with tiny diameter
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Computing all the best swap edges distributively
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
The weighted spanning tree constraint revisited
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
Research paper: The saga of minimum spanning trees
Computer Science Review
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
Operations Research Letters
Computing the rooted triplet distance between galled trees by counting triangles
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Finding dominators via disjoint set union
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Faster algorithm to find anti-risk path between two nodes of an undirected graph
Journal of Combinatorial Optimization
| Hi-index | 0.01 |