| 2008 |
| 13 | EE | Guy E. Blelloch,
Rezaul Alam Chowdhury,
Phillip B. Gibbons,
Vijaya Ramachandran,
Shimin Chen,
Michael Kozuch:
Provably good multicore cache performance for divide-and-conquer algorithms.
SODA 2008: 501-510 |
| 2007 |
| 12 | EE | Rezaul Alam Chowdhury,
Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation.
SPAA 2007: 71-80 |
| 2006 |
| 11 | EE | Rezaul Alam Chowdhury,
Vijaya Ramachandran:
Cache-oblivious dynamic programming.
SODA 2006: 591-600 |
| 10 | EE | Rezaul Alam Chowdhury,
Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation.
SPAA 2006: 236 |
| 2005 |
| 9 | EE | Rezaul Alam Chowdhury,
Vijaya Ramachandran:
External-memory exact and approximate all-pairs shortest-paths in undirected graphs.
SODA 2005: 735-744 |
| 2004 |
| 8 | EE | Rezaul Alam Chowdhury,
Peter Djeu,
Brendon Cahoon,
James H. Burrill,
Kathryn S. McKinley:
The Limits of Alias Analysis for Scalar Optimizations.
CC 2004: 24-38 |
| 7 | EE | Rezaul Alam Chowdhury,
Vijaya Ramachandran:
Cache-oblivious shortest paths in graphs using buffer heap.
SPAA 2004: 245-254 |
| 2003 |
| 6 | EE | Mustaq Ahmed,
M. Kaykobad,
Rezaul Alam Chowdhury:
A New String Matching Algorithm.
Int. J. Comput. Math. 80(7): 825-834 (2003) |
| 5 | EE | M. Ziaur Rahman,
Rezaul Alam Chowdhury,
M. Kaykobad:
Improvements in double ended priority queues.
Int. J. Comput. Math. 80(9): 1121-1129 (2003) |
| 2002 |
| 4 | EE | Rezaul Alam Chowdhury,
Vijaya Ramachandran:
Improved Distance Oracles for Avoiding Link-Failure.
ISAAC 2002: 523-534 |
| 3 | EE | Rezaul Alam Chowdhury,
M. Kaykobad,
Irwin King:
An efficient decoding technique for Huffman codes.
Inf. Process. Lett. 81(6): 305-308 (2002) |
| 2000 |
| 2 | EE | Suman Kumar Nath,
Rezaul Alam Chowdhury,
M. Kaykobad:
Min-Max Fine Heaps
CoRR cs.DS/0007043: (2000) |
| 1999 |
| 1 | EE | Suman Kumar Nath,
Rezaul Alam Chowdhury,
M. Kaykobad:
On Average Edge Length of Minimum Spanning Trees.
Inf. Process. Lett. 70(5): 241-243 (1999) |