Parallel construction of multidimensional binary search trees

Authors:
Ibraheem Al-Furaih;Srinivas Aluru;Sanjay Goil;Sanjay Ranka
Affiliations:
NPAC and School of CIS, Syracuse University, Syracuse, NY;NPAC and School of CIS, Syracuse University, Syracuse, NY;NPAC and School of CIS, Syracuse University, Syracuse, NY;School of CISE, University of Florida Gainesville, FL
Venue:
ICS '96 Proceedings of the 10th international conference on Supercomputing
Year:
1996

Computational geometry: an introduction

Computational geometry: an introduction
Vector models for data-parallel computing

Vector models for data-parallel computing
Parallel sorting by regular sampling

Journal of Parallel and Distributed Computing
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Expected time bounds for selection

Communications of the ACM
Multidimensional binary search trees used for associative searching

Communications of the ACM
Unifying Themes for Network Selection

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Many-to-many personalized communication with bounded traffic

FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)

Efficient Parallel Classification Using Dimensional Aggregates

Revised Papers from Large-Scale Parallel Data Mining, Workshop on Large-Scale Parallel KDD Systems, SIGKDD

Hi-index	0.00