Selection and Sorting

Sorting and Selection in Restore Model
T. M. Chan, I. Munro and V. Raman
Procedings of SODA 2014.

Faster, space efficient selection for integers in read-only memory
T. M. Chan, J. I. Munro and V. Raman
Proceedings of ISAAC 2013.

Approximate Block Sorting [ps]
M. Mahajan and R. Rama and V. Raman and S. Vijayakumar.
International Journal of Foundations of Computer Science
Volume 17(2) (April 2006), pp. 337--355.

On the pseudoachromatic number of join of graphs
R Balasubramanian, V. Raman V. Yegnanarayanan
International Journal of Computer Mathematics
Vol 80 No. 9 pages 1131-1137 (Sept 2003)

Improved Upper Bounds for Time-Space Tradeoffs for Selection 
V. Raman and S. Ramnath.
Nordic Journal of Computing 6 (1999) 162-180.

Selecting small ranks in EREW PRAM 
S. Ramnath and V. Raman.
Information Processing Letters 71 (1999) 183-186.

Finding Generalized Hamiltonian paths in Tournaments
Proceedings of the conference on Graph Connections(1999)

Finding Scores in Tournaments 
R. Balasubramanian, V. Raman and G. Srinivasaraghavan.
Journal of Algorithms 24 (1997) 380-394.

Selection from Read-Only Memory and Sorting with minimum Data Movement 
J. I. Munro and V. Raman.
Theoretical Computer Science 165 (1996) 311-323.

Fast Stable In-Place Sorting with O(n) Data Moves
J. I. Munro and Venkatesh Raman
Algorithmica 16(2):151-160 (1996).

Sorting Multisets and Vectors In-Place
J. I. Munro and Venkatesh Raman
WADS 1991: 473-480.

Stable in situ sorting and minimum data movement 
J. I. Munro, V. Raman, J.S. Salowe
BIT 30(1990) 220-234

Sorting with Minimum Data Movement
J. I. Munro and V. Raman
Journal of Algorithms 13(3) (1992)