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.

cited authors

  • Dekel, E; Peng, S; Iyengar, SS

authors

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

International Standard Book Number (ISBN) 10

start page

  • 1010

end page

  • 1012