| CARVIEW |
Select Language
HTTP/2 200
server: GitHub.com
content-type: text/html; charset=utf-8
last-modified: Thu, 25 Sep 2025 00:04:47 GMT
access-control-allow-origin: *
strict-transport-security: max-age=31556952
etag: W/"68d4871f-f03"
expires: Tue, 30 Dec 2025 23:04:38 GMT
cache-control: max-age=600
content-encoding: gzip
x-proxy-cache: MISS
x-github-request-id: 8073:234FE9:A9D924:BEBF78:6954582E
accept-ranges: bytes
age: 0
date: Tue, 30 Dec 2025 22:54:38 GMT
via: 1.1 varnish
x-served-by: cache-bom-vanm7210085-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1767135279.583721,VS0,VE206
vary: Accept-Encoding
x-fastly-request-id: 62ee43d00706b5e2e21f8f4fabca839bf0a3ae95
content-length: 1531
Sai Sandeep
Sai Sandeep
Email : saisandeep192 (at) gmail.com
I recently finished my postdoc at UC Berkeley. Previously, I was a Ph.D. student in CMU where I was fortunte to be advised by Venkatesan Guruswami. My research interests are in optimization and theoretical computer science broadly, approximation algorithms and hardness of approximation in particular.
Before CMU, I spent a wonderful year at Microsoft Research India as Research Fellow where I worked with Ravishankar Krishnaswamy. Prior to that, I did my undergrad from IIT Bombay.
Publications
Author names are in alphabetical order of last names, as is common in theory.- SDPs and Robust Satisfiability of Promise CSP
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
STOC 2023
- Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan
ITCS 2023
- On the Hardness of Scheduling With Non-Uniform Communication Delays
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
SODA 2022
- Conditional Dichotomy of Boolean Ordered Promise CSPs
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeeep
ICALP 2021
- Almost Optimal Inapproximability of Multidimensional Packing Problems
Sai Sandeep
FOCS 2021
- Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture
Venkatesan Guruswami, Sai Sandeep
SODA 2022
- d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors
Venkatesan Guruswami, Sai Sandeep
ICALP 2020
- Revisiting Alphabet Reduction in Dinur's PCP
Venkatesan Guruswami, Jakub Opršal, Sai Sandeep
APPROX 2020
- PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep
APPROX 2020
- Rainbow coloring hardness via low sensitivity polymorphisms
Venkatesan Guruswami, Sai Sandeep
APPROX 2019
- Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding
Ravishankar Krishnaswamy, Shi Li, Sai Sandeep
STOC 2018
- Undergraduate Research