91破解版

Skip to main content

Department of Computer Science

  1. NSM Home
  2. Department of Computer Science
  3. People
  4. Faculty
  5. Rathish Das

People

 

placeholder

Rathish Das, Ph.D.

Assistant Professor of Computer Science

Research Areas: AlgorithmsComputing and Software


 

  • Ph.D. in Computer Science, Stony Brook University, USA
  • M.Tech. in Computer Science, IIT Bombay, India

Dr. Das is an Assistant Professor in the Department of Computer Science at the University of Houston. Previously, he was a lecturer (tenure-track assistant professor) at the University of Liverpool, UK, and a postdoctoral fellow at the University of Waterloo, working with Prof. Ian Munro. He earned his Ph.D. in Computer Science from Stony Brook University under the guidance of Profs. Michael A. Bender, Rezaul A. Chowdhury, and Joseph S. B. Mitchell, where his dissertation focused on the algorithmic foundations of parallel paging and scheduling under memory constraints. Prior to that, he completed his M.Tech. in Computer Science and Engineering at IIT Bombay, Mumbai.

  • Outstanding paper award in ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2022.
  • Outstanding paper award in ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2021.
  • Rathish Das and Hao Sun. 鈥淎pproximation Hardness of Resource Scheduling.鈥� Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2025.
  • Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, and Yimin Zhu. 鈥淪peeding up Stencil Computation using Gaussian Approximations.鈥� Proceedings of the SIAM conference on Applied and Computational Discrete Algorithms (ACDA), 2025.
  • Rathish Das, Omrit Filtser, Matya Katz, and Joseph S.B. Mitchell. 鈥淩obustly Guarding Polygons.鈥� Proceedings of the 40th International Symposium on Computational Geometry (SoCG),2024.
  • Michael A. Bender, Rathish Das, Martin Farach-Colton, and Guido Tagliavini. 鈥淎n Associativity Threshold Phenomenon in Set-Associative Caches.鈥� Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023.
  • Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato. 鈥淥nline Parallel Paging with Optimal Makespan.鈥� Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022.