4315 search results - page 97 / 863 » Sorting in linear time |
MEMOCODE
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a softwa...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
ISAAC
1994
Springer
14 years 1 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
ADBIS
1998
Springer
14 years 1 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
COCO
1997
Springer
14 years 1 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...