739 search results - page 17 / 148 » Sorting Algorithms |
121
click to vote
IPPS
2002
IEEE
15 years 7 months 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...
100
Voted
ALGORITHMICA
2008
15 years 2 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...
96
Voted
WABI
2005
Springer
15 years 7 months ago
2005
Springer
97
Voted
WABI
2004
Springer
15 years 7 months ago
2004
Springer
60
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
