R
Rezaul Chowdhury
Researcher at Stony Brook University
Publications - 89
Citations - 1552
Rezaul Chowdhury is an academic researcher from Stony Brook University. The author has contributed to research in topics: Cache & Cache-oblivious algorithm. The author has an hindex of 17, co-authored 83 publications receiving 1419 citations. Previous affiliations of Rezaul Chowdhury include University of Texas at Austin & Boston University.
Papers
More filters
Proceedings ArticleDOI
Toward efficient architecture-independent algorithms for dynamic programs: poster
Mohammad Mahdi Javanmard,Pramod Ganapathr,Rathish Das,Zafar Ahmad,Stephen Tschudi,Rezaul Chowdhury +5 more
TL;DR: This work extends recursive divide-&-conquer algorithms to run efficiently also on manycore GPUs and distributed-memory machines without changing their basic structure, and shows that these algorithms are work-optimal and have low latency and bandwidth bounds.
Book ChapterDOI
Optimizing Read Reversals for Sequence Compression
Zhong Sichen,Lu Zhao,Yan Liang,Mohammadzaman Zamani,Rob Patro,Rezaul Chowdhury,Esther M. Arkin,Joseph S. B. Mitchell,Steven Skiena +8 more
TL;DR: Compression of sequence read files is an important problem because the sequential order of the reads in these files typically conveys no biologically significant information, providing the freedom to reorder them so as to facilitate compression.
Journal ArticleDOI
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort
TL;DR: A simplified complexity analysis of the BOTTOM-UP-HEAPSORT algorithm from a different viewpoint is presented and it is shown that it requires nlog2 n+n element comparisons in the worst case and nlog 2 n+0.42n comparisons on the average.
Journal ArticleDOI
Efficient Maintenance and Update of Nonbonded Lists in Macromolecular Simulations.
Rezaul Chowdhury,Dmitri Beglov,Mohammad Moghadasi,Ioannis Ch. Paschalidis,Pirooz Vakili,Sandor Vajda,Chandrajit L. Bajaj,Dima Kozakov +7 more
TL;DR: A dynamic octree data structure is proposed for implicit maintenance of nblists using space linear in the number of atoms but independent of the distance cutoff, and it is shown that octree implementation is approximately 1.5 times faster in practical use case scenarios as compared to nblist.
Proceedings ArticleDOI
Efficient Execution of Dynamic Programming Algorithms on Apache Spark
Mohammad Mahdi Javanmard,Zafar Ahmad,Jaroslaw Zola,Louis-Noël Pouchet,Rezaul Chowdhury,Robert W. Harrison +5 more
TL;DR: This work designs and implements well-decomposable and tunable dynamic programming algorithms from the Gaussian Elimination Paradigm, such as Floyd-Warshall's all-pairs shortest path and Gaussian elimination without pivoting, for execution on Apache Spark based on parametric multi-way recursive divide-&-conquer algorithms.