Rezaul Alam Chowdhury

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 8

Top Topics

Dynamic Programming

Top Venues

Theory Comput. Syst.

Publications

Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran
Fair subgraph selection for contagion containment (Brief Announcement). LAGOS (2023)
Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. ESA (2022)
Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA (2020)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Trans. Algorithms 14 (1) (2018)
Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang
The range 1 query (R1Q) problem. Theor. Comput. Sci. 743 (2018)
Valentin Polischchuk, Vijaya Ramachandran, Rezaul Alam Chowdhury
Editorial: ALENEX 2017 Special Issue. ACM J. Exp. Algorithmics 23 (2018)
Rezaul Alam Chowdhury, Pramod Ganapathi, Jesmin Jahan Tithi, Charles Bachmeier, Bradley C. Kuszmaul, Charles E. Leiserson, Armando Solar-Lezama, Yuan Tang
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs. PPOPP (2016)
Shachar Itzhaky, Rohit Singh, Armando Solar-Lezama, Kuat Yessenov, Yongquan Lu, Charles E. Leiserson, Rezaul Alam Chowdhury
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations. OOPSLA (2016)
Jesmin Jahan Tithi, Rezaul Alam Chowdhury
Efficient computation of distance incorporated codon autocorrelation (DICA) score using fast Fourier transform. BCB (2015)
Yuan Tang, Ronghui You, Haibin Kan, Jesmin Jahan Tithi, Pramod Ganapathi, Rezaul Alam Chowdhury
Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency. PPOPP (2015)
Jesmin Jahan Tithi, Pramod Ganapathi, Aakrati Talati, Sonal Aggarwal, Rezaul Alam Chowdhury
High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels. IPDPS (2015)
Deukhyun Cha, Qin Zhang, Jesmin Jahan Tithi, Alexander Rand, Rezaul Alam Chowdhury, Chandrajit L. Bajaj
Accelerated molecular mechanical and solvation energetics on multicore CPUs and manycore GPUs. BCB (2015)
Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. Theory Comput. Syst. 54 (4) (2014)
Jesmin Jahan Tithi, Pramod Ganapathi, Aakrati Talati, Rezaul Alam Chowdhury
High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels. BCB (2014)
Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang
The Range 1 Query (R1Q) Problem. COCOON (2014)
Reza Basseda, Rezaul Alam Chowdhury
A Parallel Bottom-Up Resolution Algorithm Using Cilk. ICTAI (2013)
Jesmin Jahan Tithi, Rezaul Alam Chowdhury
Polarization Energy on a Cluster of Multicores. IPDPS Workshops (2013)
Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley
Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. 73 (7) (2013)
Jesmin Jahan Tithi, Dhruv Mátáni, Gaurav Menghani, Rezaul Alam Chowdhury
Avoiding Locks and Atomic Instructions in Shared-Memory Parallel BFS Using Optimistic Parallelization. IPDPS Workshops (2013)
Jesmin Jahan Tithi, Rezaul Alam Chowdhury
Abstract: Polarization Energy on a Cluster of Multicores. SC Companion (2012)
Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. FUN (2012)
Jesmin Jahan Tithi, Rezaul Alam Chowdhury
Poster: Polarization Energy on a Cluster of Multicores. SC Companion (2012)
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibur Rasheed
A dynamic data structure for flexible molecular maintenance and informatics. Bioinform. 27 (1) (2011)
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Vinay Siddahanavalli
Dock: Fast Fourier Protein-Protein Docking. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (1) (2011)
Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson
The pochoir stencil compiler. SPAA (2011)
Rezaul Alam Chowdhury, Chandrajit L. Bajaj
Multi-level grid algorithms for faster molecular energetics. Symposium on Solid and Physical Modeling (2010)
Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, Vijaya Ramachandran
Oblivious algorithms for multicores and network of processors. IPDPS (2010)
Rezaul Alam Chowdhury, Vijaya Ramachandran
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation. Theory Comput. Syst. 47 (4) (2010)
Rezaul Alam Chowdhury, Hai-Son Le, Vijaya Ramachandran
Cache-Oblivious Dynamic Programming for Bioinformatics. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (3) (2010)
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibur Rasheed
A dynamic data structure for flexible molecular maintenance and informatics. Symposium on Solid and Physical Modeling (2009)
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)
Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37 (5) (2008)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-efficient dynamic programming algorithms for multicores. SPAA (2008)
Rezaul Alam Chowdhury, Vijaya Ramachandran
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA (2007)
Rezaul Alam Chowdhury, Vijaya Ramachandran
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. SPAA (2006)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-oblivious dynamic programming. SODA (2006)
Rezaul Alam Chowdhury, Vijaya Ramachandran
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. SODA (2005)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-oblivious shortest paths in graphs using buffer heap. SPAA (2004)
Rezaul Alam Chowdhury, Peter Djeu, Brendon Cahoon, James H. Burrill, Kathryn S. McKinley
The Limits of Alias Analysis for Scalar Optimizations. CC (2004)
Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury
A New String Matching Algorithm. Int. J. Comput. Math. 80 (7) (2003)
M. Ziaur Rahman, Rezaul Alam Chowdhury, M. Kaykobad
Improvements in double ended priority queues. Int. J. Comput. Math. 80 (9) (2003)
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
An efficient decoding technique for Huffman codes. Inf. Process. Lett. 81 (6) (2002)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Improved Distance Oracles for Avoiding Link-Failure. ISAAC (2002)
Rezaul Alam Chowdhury, Mohammad Kaykobad
Sorting using heap structure. Int. J. Comput. Math. 77 (3) (2001)
Rezaul Alam Chowdhury, M. Kaykobad
Calculating the square root with arbitrary order of convergence. Int. J. Comput. Math. 75 (3) (2000)
Rezaul Alam Chowdhury, M. Kaykobad, Suman Kumar Nath
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort. Int. J. Comput. Math. 73 (3) (2000)
Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad
Min-Max Fine Heaps CoRR (2000)
Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad
On Average Edge Length of Minimum Spanning Trees. Inf. Process. Lett. 70 (5) (1999)
M. Kaykobad, Rezaul Alam Chowdhury, Md. Sanaul Hoque
Mode-finding algorithms revisited. Int. J. Comput. Math. 69 (3-4) (1998)