Rathish Das

I am an assistant professor in the Department of Computer Science at the University of Houston. Prior to that I was a lecturer (tenure-track assistant professor) at the University of Liverpool, UK, and a postdoctoral fellow at the University of Waterloo, hosted by Prof. Ian Munro. I completed my Ph.D in the Computer Science Department of Stony Brook University where I was fortunate to be advised by Prof. Michael A. Bender, Prof. Rezaul A. Chowdhury, and Prof. Joseph S. B. Mitchell. My Ph.D. thesis was on Algorithmic Foundation of Parallel Paging and Scheduling under Memory Constraints. 

Before coming to Stony Brook University, I did my masters in Computer Science and Engineering at IIT Bombay, Mumbai. 

Postdoc opening: I have a postdoc position in parallel algorithms and combinatorial optimization (approximation and online algorithms). If you are interested, please send me your CV. More information can be found here.

Ph.D. openings: I am looking for highly motivated Ph.D. students. If you are interested in algorithms research, please send me your CV.

Research Interest

My research interests primarily lie in approximation and randomized algorithms. In particular, I use approximation and randomization techniques in two major areas: (1) parallel and distributed algorithms for multiprocessor systems and (2) algorithms for massive data sets (``big data''). In the area of multiprocessor computing I concentrate on the algorithmic modeling of the hardware as well as the design and analysis of efficient algorithms for multiprocessor systems. For big data applications I work on I/O-efficient external-memory algorithms and data structures where data is too big to fit into the internal memory and must be retained on external storage.

I also design approximation and randomized algorithms for scheduling, graph, and computational geometry problems. In addition, I solve problems that arise in other areas of science and engineering beyond computer science. 

Refereed Conference Publications (Selected)

[Author lists ending with (*) are presented alphabetically as is customary in theoretical computer science.]

• Rathish Das, Omrit Filtser, Matya Katz, and Joseph S.B. Mitchell (*), “Robustly Guarding Polygons.” Proceedings of the 40th International Symposium on Computational Geometry (SoCG), Pages 47:1-47:17, 2024. [PDF]. Invited to the special issue at the Journal of Computational Geometry (JoCG).

• Zafar Ahmad, Reilly Browne, Rezaul Chowdhury, Rathish Das, Yushen Huang, and Yimin Zhu (*),  “Fast American Option Pricing using Nonlinear Stencils.” Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP), Pages 316-312, 2024. [PDF].

• Michael A. Bender, Rathish Das, Martin Farach-Colton, and Guido Tagliavini (*), “An Associativity Threshold Phenomenon in Set-Associative Caches.” Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Pages 117-127, 2023. [PDF]. 

• Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato (*). “Online Parallel Paging with Optimal Makespan.” Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Pages 205-216, 2022. [PDF]. Outstanding paper award winner (Best paper finalist). 

• Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, and Mohammad Mahdi Javanmard (*). “Low-Depth Parallel Algorithms for the Binary-Forking Model.” Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Pages 22-34, 2021. [PDF], [Video talk]. Outstanding paper award winner (Best paper finalist). 

• Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, and Yimin Zhu (*). “Fast Stencil Computations using Fast Fourier Transforms.” Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Pages 8-21, 2021. [PDF]. Outstanding paper award winner (Best paper finalist).

• Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato (*). “Tight Bounds of Parallel Paging and Green Paging.” Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Pages 3022-3041, 2021. [PDF], [Video talk]. 

• Michael A. Bender, Rathish Das, Rob Johnson, Martín Farach-Colton, and William Kuszmaul (*). “Flushing without Cascades.” Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 650-669, 2020. [PDF]. 

For a complete list of my publications, please refer to my Google Scholar page. 

Program Committee Member

• 33rd European Symposium on Algorithms, Track-S (ESA) 2025.

• 30th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming (PPoPP) 2025.

• 36th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2024.

• 31st European Symposium of Algorithms, Track-A (ESA) 2023. 

• 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2023. 

• 4th SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS) 2023. 

• 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2022.

• 3rd SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS) 2022. 

Contact

Email: rathish AT uh DOT edu