Scholar
Rathish Das
Google Scholar ID: jONg_qUAAAAJ
University of Houston
Citations & Impact
Citations
210
H-index
9
i10-index
7
Publications
20
Co-authors
0
Contact
Resume (English only)
Academic Achievements
- Published multiple academic papers, including 'History-Independent Maximal Matchings Can be Surprisingly Efficient, and Lead to Better Worst-Case Guarantees' (SODA 2026), 'Approximation Hardness of Resource Scheduling' (SPAA 2025), 'Speeding up Stencil Computation using Gaussian Approximations' (ACDA 2025), 'Robustly Guarding Polygons' (SoCG 2024).
Research Experience
- Currently an Assistant Professor in the Department of Computer Science at the University of Houston; previously 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.
Education
- Ph.D. from the Department of Computer Science at Stony Brook University, advised by Prof. Michael A. Bender, Prof. Rezaul A. Chowdhury, and Prof. Joseph S. B. Mitchell; M.S. in Computer Science and Engineering from IIT Bombay, Mumbai.
Background
- Research interests primarily lie in approximation and randomized algorithms, particularly in parallel and distributed algorithms for multiprocessor systems and algorithms for massive data sets ("big data"). In the area of multiprocessor computing, he focuses on algorithmic modeling of hardware and the design and analysis of efficient algorithms. For big data applications, he works on I/O-efficient external-memory algorithms and data structures.
Miscellany
- Has a postdoc position opening in parallel algorithms and combinatorial optimization (approximation and online algorithms).
Co-authors