739 search results - page 17 / 148 » Sorting Algorithms |
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
ALGORITHMICA
2008
13 years 7 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
WABI
2005
Springer
14 years 29 days ago
2005
Springer
WABI
2004
Springer
14 years 25 days ago
2004
Springer
STOC
2010
ACM
14 years 9 days ago
2010
ACM
