The least weight subsequence problem
SIAM Journal on Computing
The concave least-weight subsequence problem revisited
Journal of Algorithms
A simple parallel tree contraction algorithm
Journal of Algorithms
Constructing trees in parallel
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A fast algorithm for optimal length-limited Huffman codes
Journal of the ACM (JACM)
Finding least-weight subsequences with fewer processors
SIGAL '90 Proceedings of the international symposium on Algorithms
Parallel construction of near optimal binary trees
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
Parallel techniques for construction of trees and related problems
Parallel techniques for construction of trees and related problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A unifying look at data structures
Communications of the ACM
Efficient dynamic programming using quadrangle inequalities
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Parallel construction of optimal alphabetic trees
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Computing a minimum-weight k-link path in graphs with the concave Monge property
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Information Theory
| Hi-index | 0.07 |