default search action
Rezaul Alam Chowdhury
Rezaul Chowdhury
Person information
- affiliation: Stony Brook University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c50]Zafar Ahmad
, Reilly Browne
Fast American Option Pricing using Nonlinear Stencils. PPoPP 2024: 316-332 - [e1]Rezaul Chowdhury, Solon P. Pissis:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024. SIAM 2024, ISBN 978-1-61197-792-9 [contents] - 2023
- [j22]Pramod Ganapathi, Rezaul Chowdhury:
A Unified Framework to Discover Permutation Generation Algorithms. Comput. J. 66(3): 603-614 (2023) - [j21]Zafar Ahmad
A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms. ACM Trans. Parallel Comput. 10(4): 22:1-22:34 (2023) - [c49]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: 370-372 - [i7]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Yushen Huang, Yimin Zhu
Fast Option Pricing using Nonlinear Stencils. CoRR abs/2303.02317 (2023) - [i6]Reilly Browne, Rezaul Chowdhury, Shih-Yu Tsai, Yimin Zhu:
Cache-Oblivious Parallel Convex Hull in the Binary Forking Model. CoRR abs/2305.10389 (2023) - 2022
- [j20]Pramod Ganapathi, Rezaul Chowdhury:
Parallel Divide-and-Conquer Algorithms for Bubble Sort, Selection Sort and Insertion Sort. Comput. J. 65(10): 2709-2719 (2022) - [c48]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: 16:1-16:17 - [c47]Zafar Ahmad, Mohammad Mahdi Javanmard, Gregory Thomas Croisdale
FOURST: A code generator for FFT-based fast stencil computations. ISPASS 2022: 99-108 - [c46]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu
Brief Announcement: Faster Stencil Computations using Gaussian Approximations. SPAA 2022: 291-293 - [i5]Jesmin Jahan Tithi, Yonatan Fogel, Rezaul Chowdhury:
An Optimal Level-synchronous Shared-memory Parallel BFS Algorithm with Optimal parallel Prefix-sum Algorithm and its Implications for Energy Consumption. CoRR abs/2209.08764 (2022) - 2021
- [c45]Rezaul Chowdhury, Francesco Silvestri
Algorithm Design for Tensor Units. Euro-Par 2021: 353-367 - [c44]Poornima Nookala
Understanding Recursive Divide-and-Conquer Dynamic Programs in Fork-Join and Data-Flow Execution Models. IPDPS Workshops 2021: 407-416 - [c43]Zafar Ahmad
Fast Stencil Computations using Fast Fourier Transforms. SPAA 2021: 8-21 - [c42]Zafar Ahmad
Low-Span Parallel Algorithms for the Binary-Forking Model. SPAA 2021: 22-34 - [i4]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu:
Fast Stencil Computations using Fast Fourier Transforms. CoRR abs/2105.06676 (2021) - 2020
- [c41]Mohammad Mahdi Javanmard, Zafar Ahmad
Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers. CGO 2020: 317-329 - [c40]Mohammad Mahdi Javanmard, Zafar Ahmad
Efficient Execution of Dynamic Programming Algorithms on Apache Spark. CLUSTER 2020: 337-348 - [c39]Zafar Ahmad
Improved MapReduce Load Balancing through Distribution-Dependent Hash Function Optimization. ICPADS 2020: 9-18 - [c38]Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA 2020: 63-73 - [c37]Rezaul Chowdhury, Francesco Silvestri, Flavio Vella
A Computational Model for Tensor Core Units. SPAA 2020: 519-521 - [i3]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Mohammad Mahdi Javanmard:
Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics. CoRR abs/2008.13292 (2020)
2010 – 2019
- 2019
- [c36]Shih-Yu Tsai, Hao-Tsung Yang
Multi-channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications. ALGOSENSORS 2019: 137-157 - [c35]Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Zafar Ahmad, Stephen L. Tschudi, Rezaul Chowdhury:
Toward efficient architecture-independent algorithms for dynamic programs: poster. PPoPP 2019: 413-414 - [c34]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA 2019: 359-368 - [c33]Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Zafar Ahmad
Toward Efficient Architecture-Independent Algorithms for Dynamic Programs. ISC 2019: 143-164 - [i2]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. CoRR abs/1904.09283 (2019) - 2018
- [j19]Valentin Polishchuk, Vijaya Ramachandran, Rezaul Alam Chowdhury:
Editorial: ALENEX 2017 Special Issue. ACM J. Exp. Algorithmics 23 (2018) - [j18]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Trans. Algorithms 14(1): 1:1-1:33 (2018) - [j17]Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi
The range 1 query (R1Q) problem. Theor. Comput. Sci. 743: 130-147 (2018) - 2017
- [j16]Rezaul Chowdhury, Pramod Ganapathi, Stephen L. Tschudi, Jesmin Jahan Tithi, Charles Bachmeier, Charles E. Leiserson, Armando Solar-Lezama
Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems. ACM Trans. Parallel Comput. 4(1): 4:1-4:30 (2017) - [c32]Rezaul Chowdhury, Pramod Ganapathi
POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms. PPoPP 2017: 435-436 - [c31]Rezaul Chowdhury, Pramod Ganapathi
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms. SPAA 2017: 339-350 - 2016
- [c30]Rezaul Chowdhury, Pramod Ganapathi
An Efficient Cache-oblivious Parallel Viterbi Algorithm. Euro-Par 2016: 574-587 - [c29]Michael A. Bender, Rezaul Chowdhury, Alexander Conway, Martin Farach-Colton
The I/O Complexity of Computing Prime Tables. LATIN 2016: 192-206 - [c28]Shachar Itzhaky, Rohit Singh, Armando Solar-Lezama
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations. OOPSLA 2016: 145-164 - [c27]Rezaul Alam Chowdhury, Pramod Ganapathi
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs. PPoPP 2016: 10:1-10:12 - [r2]Rezaul Alam Chowdhury:
Equivalence Between Priority Queues and Sorting. Encyclopedia of Algorithms 2016: 645-650 - 2015
- [c26]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: 222-231 - [c25]Jesmin Jahan Tithi, Rezaul Alam Chowdhury:
Efficient computation of distance incorporated codon autocorrelation (DICA) score using fast Fourier transform. BCB 2015: 515-516 - [c24]Jesmin Jahan Tithi, Pramod Ganapathi
High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels. IPDPS 2015: 303-312 - [c23]Yuan Tang, Ronghui You, Haibin Kan, Jesmin Jahan Tithi, Pramod Ganapathi
Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency. PPoPP 2015: 205-214 - [c22]Zhong Sichen, Lu Zhao, Yan Liang
Optimizing Read Reversals for Sequence Compression - (Extended Abstract). WABI 2015: 189-202 - 2014
- [j15]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): 715-730 (2014) - [c21]Jesmin Jahan Tithi, Pramod Ganapathi
High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels. BCB 2014: 600-601 - [c20]Michael A. Bender, Rezaul Alam Chowdhury, Pramod Ganapathi
The Range 1 Query (R1Q) Problem. COCOON 2014: 116-128 - 2013
- [j14]Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri
Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. 73(7): 911-925 (2013) - [c19]Reza Basseda, Rezaul Alam Chowdhury:
A Parallel Bottom-Up Resolution Algorithm Using Cilk. ICTAI 2013: 95-100 - [c18]Jesmin Jahan Tithi, Rezaul Alam Chowdhury:
Polarization Energy on a Cluster of Multicores. IPDPS Workshops 2013: 569-578 - [c17]Jesmin Jahan Tithi, Dhruv Mátáni
Avoiding Locks and Atomic Instructions in Shared-Memory Parallel BFS Using Optimistic Parallelization. IPDPS Workshops 2013: 1628-1637 - 2012
- [c16]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: 28-39 - [c15]Jesmin Jahan Tithi, Rezaul Alam Chowdhury:
Abstract: Polarization Energy on a Cluster of Multicores. SC Companion 2012: 1377-1378 - [c14]Jesmin Jahan Tithi, Rezaul Alam Chowdhury:
Poster: Polarization Energy on a Cluster of Multicores. SC Companion 2012: 1379 - 2011
- [j13]Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibur Rasheed:
A dynamic data structure for flexible molecular maintenance and informatics. Bioinform. 27(1): 55-62 (2011) - [j12]Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Vinay Siddahanavalli:
F2Dock: Fast Fourier Protein-Protein Docking. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 45-58 (2011) - [c13]Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson:
The pochoir stencil compiler. SPAA 2011: 117-128 - 2010
- [j11]Rezaul Alam Chowdhury, Vijaya Ramachandran:
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation. Theory Comput. Syst. 47(4): 878-919 (2010) - [j10]Rezaul Alam Chowdhury, Hai-Son Le, Vijaya Ramachandran:
Cache-Oblivious Dynamic Programming for Bioinformatics. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 495-510 (2010) - [c12]Rezaul Alam Chowdhury, Francesco Silvestri
Oblivious algorithms for multicores and network of processors. IPDPS 2010: 1-12 - [c11]Rezaul Alam Chowdhury, Chandrajit L. Bajaj:
Multi-level grid algorithms for faster molecular energetics. Symposium on Solid and Physical Modeling 2010: 147-152
2000 – 2009
- 2009
- [c10]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: 259-270 - 2008
- [j9]Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran:
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37(5): 1299-1318 (2008) - [c9]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 - [c8]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-efficient dynamic programming algorithms for multicores. SPAA 2008: 207-216 - [r1]Rezaul Alam Chowdhury:
Equivalence Between Priority Queues and Sorting. Encyclopedia of Algorithms 2008 - 2007
- [c7]Rezaul Alam Chowdhury, Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA 2007: 71-80 - 2006
- [c6]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-oblivious dynamic programming. SODA 2006: 591-600 - [c5]Rezaul Alam Chowdhury, Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. SPAA 2006: 236 - 2005
- [c4]Rezaul Alam Chowdhury, Vijaya Ramachandran:
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. SODA 2005: 735-744 - 2004
- [c3]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 - [c2]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-oblivious shortest paths in graphs using buffer heap. SPAA 2004: 245-254 - 2003
- [j8]Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury:
A New String Matching Algorithm. Int. J. Comput. Math. 80(7): 825-834 (2003) - [j7]M. Ziaur Rahman, Rezaul Alam Chowdhury, M. Kaykobad:
Improvements in double ended priority queues. Int. J. Comput. Math. 80(9): 1121-1129 (2003) - 2002
- [j6]Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
An efficient decoding technique for Huffman codes. Inf. Process. Lett. 81(6): 305-308 (2002) - [c1]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Improved Distance Oracles for Avoiding Link-Failure. ISAAC 2002: 523-534 - 2001
- [j5]Rezaul Alam Chowdhury, Mohammad Kaykobad:
Sorting using heap structure. Int. J. Comput. Math. 77(3): 347-354 (2001) - 2000
- [j4]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): 293-297 (2000) - [j3]Rezaul Alam Chowdhury, M. Kaykobad:
Calculating the square root with arbitrary order of convergence. Int. J. Comput. Math. 75(3): 297-302 (2000) - [i1]Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad:
Min-Max Fine Heaps. CoRR cs.DS/0007043 (2000)
1990 – 1999
- 1999
- [j2]Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad:
On Average Edge Length of Minimum Spanning Trees. Inf. Process. Lett. 70(5): 241-243 (1999) - 1998
- [j1]M. Kaykobad, Rezaul Alam Chowdhury, Md. Sanaul Hoque
Mode-finding algorithms revisited. Int. J. Comput. Math. 69(3-4): 253-263 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: