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.

Siddharth Meenachi Sundaram in Central Park

Publications and Preprints

  1. The Cube-Root Phenomenon in Online Carpooling

    Nikhil Bansal, Milind Prabhu, Sahil Singla, Siddharth M. Sundaram

    ITCS 2027 (to appear) arXiv

  2. Efficient Algorithms for Online Subadditive Combinatorial Allocations

    Calum MacRury, Rian Neogi, Kanstantsin Pashkovich, Sahil Singla, Siddharth M. Sundaram, Chaitanya Swamy

    SODA 2027 (to appear) arXiv

  3. Online Graph Balancing and the Power of Two Choices

    Nikhil Bansal, Milind Prabhu, Sahil Singla, Siddharth M. Sundaram

    FOCS 2026 arXiv

Awards

Teaching

Service

Contact

You can reach me at ssundaram38@gatech.edu.