4315 search results - page 2 / 863 » Sorting in linear time |
TALG
2011
13 years 1 months ago
2011
ISCAS
2003
IEEE
13 years 11 months ago
2003
IEEE
The full-custom CMOS realization of a new modular sorting architecture is presented. The high-performance architecture is based on rank ordering, and on efficient implementation o...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
DCC
2009
IEEE
14 years 6 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...