Sciweavers

739 search results - page 28 / 148
» Sorting Algorithms
Sort
View
ICALP
2007
Springer
13 years 11 months ago
In-Place Suffix Sorting
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...
Gianni Franceschini, S. Muthukrishnan
STACS
1995
Springer
13 years 11 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...
POPL
2008
ACM
14 years 7 months ago
Much ado about two (pearl): a pearl on parallel prefix computation
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
Janis Voigtländer
IPPS
1998
IEEE
13 years 11 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
PVLDB
2008
90views more  PVLDB 2008»
13 years 7 months ago
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of ...
Ioannis Koltsidas, Heiko Müller, Stratis Vigl...