Florida International University
Edit Your Profile
FIU Discovery
Toggle navigation
Browse
Home
People
Organizations
Scholarly & Creative Works
Research Facilities
Support
Edit Your Profile
OPTIMAL PARALLEL ALGORITHMS FOR CONSTRUCTING A BALANCED M-WAY SEARCH TREE.
Conference
Dekel, E, Peng, S, Iyengar, SS. (1986). OPTIMAL PARALLEL ALGORITHMS FOR CONSTRUCTING A BALANCED M-WAY SEARCH TREE. .
1010-1012.
Share this citation
Twitter
Email
Dekel, E, Peng, S, Iyengar, SS. (1986). OPTIMAL PARALLEL ALGORITHMS FOR CONSTRUCTING A BALANCED M-WAY SEARCH TREE. .
1010-1012.
Copy Citation
Share
Overview
Additional Document Info
View All
Overview
cited authors
Dekel, E; Peng, S; Iyengar, SS
authors
Iyengar, S.S.
abstract
Parallel algorithms are presented for constructing balanced m-way search trees. These parallel algorithms have time complexity O(1) for an n-processor configuration.
publication date
December 1, 1986
Additional Document Info
start page
1010
end page
1012