Sciweavers

4315 search results - page 10 / 863
» Sorting in linear time
Sort
View
ORL
2000
77views more  ORL 2000»
13 years 7 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ICPP
1995
IEEE
13 years 11 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
ISHPC
2003
Springer
14 years 20 days ago
Distribution-Insensitive Parallel External Sorting on PC Clusters
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...
Minsoo Jeon, Dongseung Kim
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
13 years 8 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb