Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
On some algorithms for multiple inheritance in object-oriented programming
European conference on object-oriented programming on ECOOP '87
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the exponent of the all pairs shortest path problem
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Recursive star-tree parallel data structure
SIAM Journal on Computing
Finding lowest common ancestors in arbitrarily directed trees
Information Processing Letters
New algorithms for the LCA problem and the binary tree reconstruction problem
Information Processing Letters
Finding level-ancestors in trees
Journal of Computer and System Sciences
Tree structure for distributive lattices and its applications
Theoretical Computer Science
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
ICS '97 Proceedings of the 11th international conference on Supercomputing
All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
The lowest common ancestor problem on a tree with an unfixed root
Information Sciences: an International Journal
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Reasoning with taxonomies
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Computing suffix links for suffix trees and arrays
Information Processing Letters
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
A Hybrid Method of Indexing Multiple-Inheritance Hierarchies
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
LCA queries in directed acyclic graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Discrete range searching primitive for the GPU and its applications
Journal of Experimental Algorithmics (JEA)
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |