25 search results - page 2 / 5 » Optimal Average Case Sorting on Arrays |
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
ICALP
2007
Springer
13 years 9 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
APL
1998
ACM
13 years 9 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...