248 search results - page 3 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
SODA
1994
ACM
13 years 9 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
ICSEA
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...