Skip to main content
Conference Proceedings

On a sublinear time parallel construction of optimal binary search trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 841 LNCS 453-461
DOI: 10.1007/3-540-58338-6_92
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We design an efficient sublinear time parallel construction of optimal binary search trees. The efficiency of the parallel algorithm corresponds to its total work (the product time × processors). Our algorithm works in O(n1−ɛlog n) time with the total work O(n2+2ɛ), for an arbitrarily small constant 0

Cite

CITATION STYLE

APA

Karpinski, M., & Rytter, W. (1994). On a sublinear time parallel construction of optimal binary search trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 841 LNCS, pp. 453–461). Springer Verlag. https://doi.org/10.1007/3-540-58338-6_92

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free