
- Oracles for Distances Avoiding a Failed Node or Link Camil Demetrescu
- Cache-oblivious Dynamic Programming for Bioinformatics
- Coding Stencil Computations Using the Pochoir Stencil-Specification Language
- The Cache-oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental
- The Limits of Alias Analysis for Scalar Optimizations Rezaul A. Chowdhury
- Oblivious Algorithms for Multicores and Network of Processors Rezaul Alam Chowdhury1, Francesco Silvestri2, Brandon Blakeley1, and Vijaya Ramachandran1
- Dock: A Fast, Flexible and Fourier Based Approach to Protein-Protein Docking
- Cache-efficient Dynamic Programming Algorithms for Multicores Rezaul Alam Chowdhury Vijaya Ramachandran
- Efficient Cache-oblivious String Algorithms for Bioinformatics Rezaul Alam Chowdhury Hai-Son Le Vijaya Ramachandran
- IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 1 F 2 Dock: Fast Fourier ProteinProtein Docking
- E cient Cache-oblivious String Algorithms for Bioinformatics #
- Information Processing Letters 81 (2002) 305308 An efficient decoding technique for Huffman codes
- Priority Queues and Dijkstra's Algorithm Rezaul Alam Chowdhury
- The CacheOblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation #
- The Pochoir Stencil Compiler Yuan Tang Rezaul Chowdhury Bradley C. Kuszmaul
- ExternalMemory Exact and Approximate AllPairs ShortestPaths in Undirected Graphs #
- Cache-efficient Dynamic Programming Algorithms for Rezaul Alam Chowdhury
- IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 1 F2Dock: Fast Fourier Protein-Protein Docking
- External-Memory Exact and Approximate All-Pairs Shortest-Paths in Undirected Graphs
- CacheOblivious Shortest Paths in Graphs Using Buffer Heap
- Oblivious Algorithms for Multicores and Network of Processors # Rezaul Alam Chowdhury 1 , Francesco Silvestri 2 , Brandon Blakeley 1 , and Vijaya Ramachandran 1
- Priority Queues and Dijkstra's Algorithm # Mo Chen + Rezaul Alam Chowdhury # Vijaya Ramachandran
- E#cient Cacheoblivious String Algorithms for Bioinformatics # Rezaul Alam Chowdhury HaiSon Le Vijaya Ramachandran
- Experimental Evaluation of an E#cient CacheOblivious LCS Algorithm # Rezaul Alam Chowdhury
- Experimental Evaluation of an Efficient Cache-Oblivious LCS Algorithm Rezaul Alam Chowdhury
- Cacheoblivious Dynamic Programming for Bioinformatics
- The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework and Experimental Evaluation
- F 3 Dock: A Fast, Flexible and Fourier Based Approach to ProteinProtein Docking
- A Dynamic Data Structure for Flexible Molecular Maintenance and Informatics #
- A Dynamic Data Structure for Flexible Molecular Maintenance and Informatics
- Rezaul Alam Chowdhury The Dissertation Committee for Rezaul Alam Chowdhury
- The Pochoir Stencil Compiler Yuan Tang Rezaul Chowdhury Bradley C. Kuszmaul
- The CacheOblivious Gaussian Elimination Paradigm: Theoretical Framework and Experimental Evaluation #
- Rezaul Alam Chowdhury The Dissertation Committee for Rezaul Alam Chowdhury
- Coding Stencil Computations Using the Pochoir StencilSpecification Language
- The Cacheoblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental
- Oblivious Algorithms for Multicores and Network of Processors Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley and Vijaya Ramachandran
- The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
- Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms
- Cache-Oblivious Dynamic Programming Rezaul Alam Chowdhury Vijaya Ramachandran
- Oblivious Algorithms for Multicores and Network of Processors Rezaul Alam Chowdhury # , Francesco Silvestri + , Brandon Blakeley # and Vijaya Ramachandran #
- Information Processing Letters 70 (1999) 241243 On average edge length of minimum spanning trees
- CacheOblivious Dynamic Programming # Rezaul Alam Chowdhury Vijaya Ramachandran
- Cacheefficient Dynamic Programming Algorithms for Multicores #
- Provably Good Multicore Cache Performance for DivideandConquer Algorithms #
- Cachee#cient Dynamic Programming Algorithms for Multicores # Rezaul Alam Chowdhury Vijaya Ramachandran
- The Limits of Alias Analysis for Scalar Optimizations Rezaul A. Chowdhury 1 , Peter Djeu 1 , Brendon Cahoon 2 ,
- Cache-Oblivious Shortest Paths in Graphs Using Buffer Heap
- BIOINFORMATICS Vol. 00 no. 00 2005
- Brief Announcement: The Cache-Oblivious Gaussian Elimination Paradigm --Theoretical Framework and
- Oracles for Distances Avoiding a Failed Node or Link # Camil Demetrescu + Mikkel Thorup # R. A. Chowdhury
- Brief Announcement: The CacheOblivious Gaussian Elimination Paradigm ---Theoretical Framework and