logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A parallel algorithm for optimum height-limited alphabetic binary trees

delete1996-05-01
delete4
PRE
AI
T
Teresa M. Przytycka
DOI：10.1006/jpdc.1996.0067delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, an O(L log n)-time n-processor parallel EREW PRAM algorithm is presented for construction of an optimal alphabetic binary tree with height restricted to L. The technique used is parallel package merge. (C) 1996 Academic Press, Inc.

Journal

Journal of Parallel and Distributed Computing cover
Journal of Parallel and Distributed Computing
IF:
4
Papers:
3.8K
Citations:
4.8K

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available