The pochoir stencil compiler Y Tang, RA Chowdhury, BC Kuszmaul, CK Luk, CE Leiserson Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011 | 414 | 2011 |

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

Oblivious algorithms for multicores and network of processors RA Chowdhury, F Silvestri, B Blakeley, V Ramachandran Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium …, 2010 | 111 | 2010 |

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

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

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

The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation RA Chowdhury, V Ramachandran Theory of Computing Systems 47 (4), 878-919, 2010 | 81 | 2010 |

Dock: Fast Fourier Protein-Protein Docking CL Bajaj, R Chowdhury, V Siddahanavalli IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (1), 45-58, 2009 | 69 | 2009 |

Priority queues and dijkstra's algorithm M Chen, RA Chowdhury, V Ramachandran, DL Roche, L Tong Computer Science Department, University of Texas at Austin, 2007 | 48 | 2007 |

Protein-Protein Docking with F^{2}Dock 2.0 and GB-RerankR Chowdhury, M Rasheed, D Keidel, M Moussalem, A Olson, M Sanner, ... PLoS One 8 (3), e51307, 2013 | 44 | 2013 |

Cache-oblivious dynamic programming for bioinformatics RA Chowdhury, HS Le, V Ramachandran IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 7 …, 2010 | 43 | 2010 |

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations S Itzhaky, R Singh, A Solar-Lezama, K Yessenov, Y Lu, C Leiserson, ... ACM SIGPLAN Notices 51 (10), 145-164, 2016 | 37 | 2016 |

Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency Y Tang, R You, H Kan, JJ Tithi, P Ganapathi, RA Chowdhury Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of …, 2015 | 32 | 2015 |

Cache-oblivious shortest paths in graphs using buffer heap RA Chowdhury, V Ramachandran Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 31 | 2004 |

Autogen: Automatic discovery of efficient recursive divide-8-conquer algorithms for solving dynamic programming problems R Chowdhury, P Ganapathi, S Tschudi, JJ Tithi, C Bachmeier, ... ACM Transactions on Parallel Computing (TOPC) 4 (1), 1-30, 2017 | 30* | 2017 |

Cache-efficient Algorithms and Data Structures: Theory and Experimental Evaluation R Chowdhury PhD thesis, Department of Computer Sciences, The University opf Texas at Austin, 2007 | 28* | 2007 |

Coding stencil computations using the pochoir stencil-specification language Y Tang, R Chowdhury, CK Luk, CE Leiserson Poster session presented at the 3rd USENIX Workshop on Hot Topics in Parallelism, 2011 | 24 | 2011 |

External-memory exact and approximate all-pairs shortest-paths in undirected graphs RA Chowdhury, V Ramachandran SODA 5, 735-744, 2005 | 24 | 2005 |

A dynamic data structure for flexible molecular maintenance and informatics C Bajaj, RA Chowdhury, M Rasheed Bioinformatics 27 (1), 55-62, 2011 | 23 | 2011 |

An efficient decoding technique for Huffman codes RA Chowdhury, M Kaykobad, I King Information processing letters 81 (6), 305-308, 2002 | 23 | 2002 |