4315 search results - page 11 / 863 » Sorting in linear time |
ICASSP
2007
IEEE
14 years 1 months ago
2007
IEEE
Spike sorting refers to the detection and classification of electric potentials (spikes) from multi-neuron recordings, a difficult but essential pre-processing step before neura...
Publication
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
JACM
2000
13 years 7 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...