Sciweavers

31 search results - page 2 / 7
» A Randomized Sorting Algorithm on the BSP model
Sort
View
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
13 years 11 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
13 years 9 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
RSA
2002
161views more  RSA 2002»
13 years 5 months ago
Asymptotic analysis of (3, 2, 1)-shell sort
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
Robert T. Smythe, J. A. Wellner
ICPP
1995
IEEE
13 years 9 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
TPDS
1998
76views more  TPDS 1998»
13 years 5 months ago
Randomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
Sanguthevar Rajasekaran, Sartaj Sahni