Rezaul Alam Chowdhury

According to our database1, Rezaul Alam Chowdhury authored at least 52 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Toward Efficient Architecture-Independent Algorithms for Dynamic Programs.
Proceedings of the High Performance Computing - 34th International Conference, 2019

Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Toward efficient architecture-independent algorithms for dynamic programs: poster.
Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Multi-channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications.
Proceedings of the Algorithms for Sensor Systems, 2019

2018
The range 1 query (R1Q) problem.
Theor. Comput. Sci., 2018

Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs.
ACM Trans. Algorithms, 2018

2017
Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems.
TOPC, 2017

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2016
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations.
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, 2016

The I/O Complexity of Computing Prime Tables.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

An Efficient Cache-oblivious Parallel Viterbi Algorithm.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Optimizing Read Reversals for Sequence Compression - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Efficient computation of distance incorporated codon autocorrelation (DICA) score using fast Fourier transform.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

Accelerated molecular mechanical and solvation energetics on multicore CPUs and manycore GPUs.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye.
Theory Comput. Syst., 2014

High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2013
Oblivious algorithms for multicores and networks of processors.
J. Parallel Distrib. Comput., 2013

Avoiding Locks and Atomic Instructions in Shared-Memory Parallel BFS Using Optimistic Parallelization.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Polarization Energy on a Cluster of Multicores.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

A Parallel Bottom-Up Resolution Algorithm Using Cilk.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012
Poster: Polarization Energy on a Cluster of Multicores.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Abstract: Polarization Energy on a Cluster of Multicores.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

2011
F2Dock: Fast Fourier Protein-Protein Docking.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

A dynamic data structure for flexible molecular maintenance and informatics.
Bioinformatics, 2011

The pochoir stencil compiler.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

2010
Cache-Oblivious Dynamic Programming for Bioinformatics.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation.
Theory Comput. Syst., 2010

Multi-level grid algorithms for faster molecular energetics.
Proceedings of the ACM Symposium on Solid and Physical Modeling, 2010

Oblivious algorithms for multicores and network of processors.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2008
Equivalence Between Priority Queues and Sorting.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Oracles for Distances Avoiding a Failed Node or Link.
SIAM J. Comput., 2008

Cache-efficient dynamic programming algorithms for multicores.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Provably good multicore cache performance for divide-and-conquer algorithms.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Cache-oblivious dynamic programming.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
External-memory exact and approximate all-pairs shortest-paths in undirected graphs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Cache-oblivious shortest paths in graphs using buffer heap.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

The Limits of Alias Analysis for Scalar Optimizations.
Proceedings of the Compiler Construction, 13th International Conference, 2004

2003
Improvements in double ended priority queues.
Int. J. Comput. Math., 2003

A New String Matching Algorithm.
Int. J. Comput. Math., 2003

2002
An efficient decoding technique for Huffman codes.
Inf. Process. Lett., 2002

Improved Distance Oracles for Avoiding Link-Failure.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Sorting using heap structure.
Int. J. Comput. Math., 2001

2000
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort.
Int. J. Comput. Math., 2000

Calculating the square root with arbitrary order of convergence.
Int. J. Comput. Math., 2000

Min-Max Fine Heaps
CoRR, 2000

1999
On Average Edge Length of Minimum Spanning Trees.
Inf. Process. Lett., 1999

1998
Mode-finding algorithms revisited.
Int. J. Comput. Math., 1998


  Loading...