In this dissertation we study bucketing algorithms for sorting, selection, Voronoi diagram
construction and the closest pair problem. Mathematical analyses of several algorithms are presented.
The algorithms are implemented to verify these analyses and to gain insight into their performance on actual machines.