Workshops
Teaching
Advising
Publications
Program Committees
Sahil Singla
Assistant Professor, School of Computer Science, Georgia Tech
Address: 2142 KACB, 266 Ferst Drive, Atlanta, GA 30332
Email: s <my last name> at gatech dot edu
Research Interests
My research is in Algorithms and Uncertainty where the goal is to design optimal algorithms for uncertain inputs by studying different forms of uncertainty together. My uncertainty models are inspired from areas such as Online Algorithms, Algorithmic Game Theory, Stochastic Optimization, Multi-Armed Bandits and Online Learning.
Here is my CV, DBLP, and Google Scholar. Also, a 3 min and a 1 hour video overview of my research.
Biography
I am an Assistant Professor in the School of Computer Science at Georgia Tech. Before coming to Atlanta, I was a Research Instructor (postdoc) at Princeton University and Institute for Advanced Study from 2018 to 2021. Earlier, I finished my PhD in Computer Science at Carnegie Mellon University where I was advised by Anupam Gupta and Manuel Blum.
Workshops and Tutorials
Teaching
- CS 7530: Randomized Algorithms, Georgia Tech (Fall 2024)
- CS 6515: Graduate Algorithms, Georgia Tech (Fall 2024)
- CS 6550/8803: Advanced Algorithms and Uncertainty, Georgia Tech (Spring 2024, Spring 2022)
- CS 3510: Design and Analysis of Algorithms, Georgia Tech (Fall 2023)
- CS 3511: Algorithms Honors, Georgia Tech (Spring 2023)
- COS 521: Advanced Algorithm Design, Princeton (Fall 2020)
- COS 397: IW Seminar on Algorithms and Uncertainty, Princeton (Fall 2020, Fall 2018)
- COS 445: Economics and Computation, Princeton (Spring 2019)
Advising
Online Algorithms and Online Learning
- Supermodular Approximation of Norms and Applications
T. Kesselheim, M. Molinaro, and S. Singla.
Symposium on Theory of Computing (STOC 2024) (video)
- Bandit Algorithms for Prophet Inequality and Pandora's Box
K. Gatmiry, T. Kesselheim, S. Singla, and Y. Wang.
Symposium on Discrete Algorithms (SODA 2024) (slides)
- Online Vector Balancing and Geometric Discrepancy
N. Bansal, H. Jiang, S. Singla, and M. Sinha.
Symposium on Theory of Computing (STOC 2020) (video, slides)
Contributed talk at HALG 2020
Invited talk at TCS+ 2020
(also see below the paper Online Discrepancy Minimization for Stochastic Arrivals)
- Online Learning with Vector Costs and Bandits with Knapsacks
T. Kesselheim and S. Singla.
Conference on Learning Theory (COLT 2020) (video, slides)
Contributed talk at HALG 2020
Algorithmic Game Theory
- Online Combinatorial Allocations and Auctions with Few Samples
P. Duetting, T. Kesselheim, B. Lucier, R. Reiffenhauser, and S. Singla.
Symposium on Foundations of Computer Science (FOCS 2024) (video)
- Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
S. Assadi, T. Kesselheim, and S. Singla.
Symposium on Discrete Algorithms (SODA 2021) (video, slides)
- Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
P. Kothari, D. Mohan, A. Schvartzman, S. Singla, and S. M. Weinberg.
Symposium on Foundations of Computer Science (FOCS 2019) (video, slides)
Invited talk at HALG 2020 (video)
- Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
S. Assadi and S. Singla.
Symposium on Foundations of Computer Science (FOCS 2019) (video, slides)
Short research note in SIGecom Exchanges
Invited to SICOMP Special Issue for FOCS 2019
Invited talk at Highlights Beyond EC at EC 2020 (video)
- Prophet Secretary for Combinatorial Auctions and Matroids
S. Ehsani, M. Hajiaghayi, T. Kesselheim, and S. Singla.
Symposium on Discrete Algorithms (SODA 2018) (slides)
SIAM Journal on Computing (SICOMP 2024)
Stochastic Discrete Optimization
Book Chapters and Theses
Program Committees
- Innovations in Theoretical Computer Science (ITCS 2025)
- Symposium on Theory of Computing (STOC 2024)
- Symposium on Discrete Algorithms (SODA 2020, SODA 2023, SODA 2024)
- International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2024)
- Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)
- Conference on Economics and Computation, Track Theory (EC 2019, EC 2020, EC 2021, EC 2023)
- EECS Rising Stars (RS 2023)
- The Web Conference, Track on Economics, Monetization, and Online Markets (TheWebConf 2022)
- International Colloquium on Automata Languages and Programming, Track A (ICALP 2021)
- Conference on Web and Internet Economics (WINE 2021)
- European Symposium on Algorithms, Track A (ESA 2019)