Vijaya Ramachandran
Vijaya Ramachandran
Verified email at
Cited by
Cited by
A survey of parallel algorithms for shared-memory machines
RM Karp, V Ramachandran
University of California at Berkeley, Berkeley CA, 1989
An optimal minimum spanning tree algorithm
S Pettie, V Ramachandran
Journal of the ACM (JACM) 49 (1), 16-34, 2002
The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms
PB Gibbons, Y Matias, V Ramachandran
SIAM Journal on Computing, 638-648, 1997
A shortest path algorithm for real-weighted undirected graphs
S Pettie, V Ramachandran
SIAM Journal on Computing 34 (6), 1398-1431, 2005
Flexible hardware acceleration for instruction-grain program monitoring
S Chen, M Kozuch, T Strigkos, B Falsafi, PB Gibbons, TC Mowry, ...
ACM SIGARCH Computer Architecture News 36 (3), 377-388, 2008
Provably good multicore cache performance for divide-and-conquer algorithms.
GE Blelloch, RA Chowdhury, PB Gibbons, V Ramachandran, S Chen, ...
SODA 8, 501-510, 2008
A new graph triconnectivity algorithm and its parallelization
GL Miller, V Ramachandran
Combinatorica 12 (1), 53-76, 1992
Efficient parallel evaluation of straight-line code and arithmetic circuits
GL Miller, V Ramachandran, E Kaltofen
SIAM Journal on Computing 17 (4), 687-695, 1988
Can a shared-memory model serve as a bridging model for parallel computation?
PB Gibbons, Y Matias, V Ramachandran
Theory of Computing Systems 32 (3), 327-359, 1999
Planarity testing in parallel
V Ramachandran, J Reif
Journal of Computer and System Sciences 49 (3), 517-561, 1994
An optimal parallel algorithm for formula evaluation
S Buss, S Cook, A Gupta, V Ramachandran
SIAM Journal on Computing 21 (4), 755-780, 1992
Improved algorithms for graph four-connectivity
A Kanevsky, V Ramachandran
Journal of Computer and System Sciences 42 (3), 288-306, 1991
Oblivious algorithms for multicores and networks of processors
RA Chowdhury, V Ramachandran, F Silvestri, B Blakeley
Journal of Parallel and Distributed Computing 73 (7), 911-925, 2013
Finding a smallest augmentation to biconnect a graph
T Hsu, V Ramachandran
SIAM Journal on Computing 22 (5), 889-912, 1993
A linear time algorithm for triconnectivity augmentation
T Hsu, V Ramachandran
FOCS 91, 548-559, 1991
Oracles for distances avoiding a failed node or link
C Demetrescu, M Thorup, RA Chowdhury, V Ramachandran
SIAM Journal on Computing 37 (5), 1299-1318, 2008
Cache-efficient dynamic programming algorithms for multicores
RA Chowdhury, V Ramachandran
Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008
Finding triconnected components by local replacement
D Fussell, V Ramachandran, R Thurimella
SIAM Journal on Computing 22 (3), 587-616, 1993
Cache-oblivious dynamic programming
RA Chowdhury, V Ramachandran
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
The diameter of sparse random graphs
D Fernholz, V Ramachandran
Random Structures & Algorithms 31 (4), 482-516, 2007
The system can't perform the operation now. Try again later.
Articles 1–20