| Copyright Notice. The documents available from this site are provided as a means to ensure timely dissemination of technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder (ACM, IEEE, Springer-Verlag, Elsevier, Taylor & Francis, etc.). Permission to make digital or hard copies of part or all of these works for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage. The electronic version of some of the works available from this site may differ from the definitive published version. | |
| - | Graph Algorithms |
| - | All |
| - | External-Memory / Cache-Efficient / Cache-Oblivious |
| - | Computational Biology / Bioinformatics |
| - | Multicore Computing |
| - | Data Structures |
| - | Compilers |
| 1. | Rezaul Alam Chowdhury, "Cache-efficient Algorithms and Data Structures: Theory and Experimental Evaluation", PhD Thesis, Department of Computer Sciences, The University of Texas at Austin, 2007. |
| View: Abstract | |
| Download: PS, PDF |
| 1. | Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, and Vijaya Ramachandran, "Oracles for Distances Avoiding a Failed Node or Link", SIAM Journal on Computing, vol. 37 (5), pp. 1299-1318, 2008. |
| Preliminary Version | |
| View: Abstract | |
| Download: PS, PDF |
| 1. | Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, and Vijaya Ramachandran, "Oblivious Algorithms for Multicores and Network of Processors", To Appear in the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, Georgia, April 19-23, 2010 (Best Paper Award in the Algorithms Track). |
| View: Abstract | |
| Download: PS, PDF | |
| 2. | Rezaul Alam Chowdhury and Vijaya Ramachandran, "External-Memory Exact and Approximate All-Pairs Shortest-Paths in Undirected Graphs", Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, BC, Canada, pp. 735-744, 2005. |
| View: Abstract | |
| Download: PS, PDF | |
| 3. | Rezaul Alam Chowdhury and Vijaya Ramachandran, "Cache-Oblivious Shortest-Paths in Graphs Using Buffer Heap", Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), Barcelona, Spain, pp. 245-254, 2004. |
| View: Abstract | |
| Download: PS, PDF | |
| 1. | Rezaul Alam Chowdhury and Vijaya Ramachandran, "Cache-oblivious Buffer Heap and Cache-efficient Computation of Shortest Paths in Graphs", 2007. |
| 1. | Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, and Vijaya Ramachandran, "Oblivious Algorithms for Multicores and Network of Processors", The University of Texas at Austin, Department of Computer Sciences, TR-09-19, July 2009, 40 pages. |
| View: Abstract | |
| Download: PS, PDF | |
| 2. | Mo Chen, Rezaul Alam Chowdhury, Vijaya Ramachandran, David Lan Roche, and Lingling Tong, "Priority Queues and Dijkstra's Algorithm", The University of Texas at Austin, Department of Computer Sciences, TR-07-54, Oct. 2007, 25 pages. |
| View: Abstract | |
| Download: PS, PDF |
| 1. | Suman Kumar Nath, Rezaul Alam Chowdhury, and M. Kaykobad, "On Average Edge Length of Minimum Spanning Trees", Information Processing Letters, vol. 70 (5), pp. 241-243, 1999. |
| View: Abstract | |
| Download: PDF |