Siddharth Meenachi Sundaram
Hi everyone, I'm Siddharth, but you can call me Sid. I am a second-year Ph.D. student in Computer Science at Georgia Tech, in the Algorithms, Combinatorics and Optimization (ACO) program. I am fortunate to be advised by Sahil Singla and Calum MacRury.
I am broadly interested in the design of online and approximation algorithms. More specifically, I have recently been thinking about problems of fair allocation of goods among buyers in a market.
Previously, I completed my Master's in Computer Science at Georgia Tech. Before that, I completed my Bachelor of Engineering in Computer Engineering at Nanyang Technological University, where I worked with Anwitaman Datta.
Publications and Preprints
-
The Cube-Root Phenomenon in Online Carpooling
ITCS 2027 (to appear) arXiv
-
Efficient Algorithms for Online Subadditive Combinatorial Allocations
SODA 2027 (to appear) arXiv
-
Online Graph Balancing and the Power of Two Choices
FOCS 2026 arXiv
Awards
- ARC-ACO Fellowship Spring 2026
- MS GTA Fellowship Fall 2023
Teaching
- TA for CS6515: Introduction to Graduate Algorithms at Georgia Tech (Fall 2024, Spring 2025)
- TA for CS3510: Undergraduate Algorithms at Georgia Tech (Summer 2024)
- TA for CS3210: Design of Operating Systems at Georgia Tech (Fall 2023, Spring 2024)
Service
- Reviewer for SODA 2026
Contact
You can reach me at ssundaram38@gatech.edu.