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. . PROCEEDINGS 45TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - ICPP 2016, 1010-1012.

cited authors

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

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.

authors

publication date

  • December 1, 1986

published in

start page

  • 1010

end page

  • 1012