A survey of parallel algorithms for shared-memory machines RM Karp University of California at Berkeley, 1988 | 1551 | 1988 |

An optimal minimum spanning tree algorithm S Pettie, V Ramachandran Journal of the ACM (JACM) 49 (1), 16-34, 2002 | 439 | 2002 |

The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms PB Gibbons, Y Matias, V Ramachandran SIAM Journal on Computing 28 (2), 733-769, 1998 | 214 | 1998 |

A shortest path algorithm for real-weighted undirected graphs S Pettie, V Ramachandran SIAM Journal on Computing 34 (6), 1398-1431, 2005 | 209* | 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 | 206 | 2008 |

Provably good multicore cache performance for divide-and-conquer algorithms GE Blelloch, RA Chowdhury, PB Gibbons, V Ramachandran, S Chen, ... Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 159 | 2008 |

A new graphy triconnectivity algorithm and its parallelization G Miller, V Ramachandran Proceedings of the nineteenth annual ACM Symposium on Theory of Computing …, 1987 | 140 | 1987 |

Can shared-memory model serve as a bridging model for parallel computation? PB Gibbons, Y Matias, V Ramachandran Proceedings of the ninth annual ACM symposium on Parallel algorithms and …, 1997 | 136 | 1997 |

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 | 136 | 1988 |

An optimal parallel algorithm for formula evaluation S Buss, S Cook, A Gupta, V Ramachandran SIAM Journal on Computing 21 (4), 755-780, 1992 | 131 | 1992 |

Planarity testing in parallel V Ramachandran, J Reif Journal of Computer and System Sciences 49 (3), 517-561, 1994 | 128* | 1994 |

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 | 119 | 2013 |

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 | 119 | 2008 |

Improved algorithms for graph four-connectivity A Kanevsky, V Ramachandran Journal of Computer and System Sciences 42 (3), 288-306, 1991 | 115* | 1991 |

Cache-efficient dynamic programming algorithms for multicores RA Chowdhury, V Ramachandran Proceedings of the twentieth annual symposium on Parallelism in algorithms …, 2008 | 112 | 2008 |

Finding a smallest augmentation to biconnect a graph TS Hsu, V Ramachandran SIAM Journal on Computing 22 (5), 889-912, 1993 | 112 | 1993 |

A linear time algorithm for triconnectivity augmentation T Hsu, V Ramachandran FOCS 91, 548-559, 1991 | 110 | 1991 |

The diameter of sparse random graphs D Fernholz, V Ramachandran Random Structures & Algorithms 31 (4), 482-516, 2007 | 106 | 2007 |

Cache-oblivious dynamic programming RA Chowdhury, V Ramachandran Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 102 | 2006 |

The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation RA Chowdhury, V Ramachandran Proceedings of the nineteenth annual ACM Symposium on Parallel Algorithms …, 2007 | 98* | 2007 |