Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees

Authors:
Marek Karpinski;Lawrence L. Larmore;Wojciech Rytter
Affiliations:
Dept. of Computer Science, University of Bonn, 53117, Bonn;Department of Computer Science, University of Nevada, Las Vegas, NV;Institute of Informatics, Warsaw University, 02-097, Warszawa
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

A subquadratic algorithm for constructing approximately optimal binary search trees

Journal of Algorithms
On efficient parallel computations for some dynamic programming problems

Theoretical Computer Science
Constructing trees in parallel

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An efficient parallel algorithm for the row minima of a totally monotone matrix

Journal of Algorithms
Parallel construction of optimal alphabetic trees

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information

The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Efficient dynamic programming using quadrangle inequalities

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

A new approach to construct near-optimal binary search trees using genetic algorithm

AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications

Hi-index	0.00