Sahil
Singla
General Information
Email:
ssingla@gatech.edu
Phone:
404.894.2000
Location - Building:
KACB
Location - Room:
2142
Roles:
Professor (any rank)
Primary Unit:
College of Computing
Website URL
Details
Degrees with subject and Postdoc Experience:
Degree Type
Research Instructor (Postdoc)
Subject
Computer Science
Year
2018-2021
Institution
Princeton University
Location
Princeton
Degree Type
Ph.D.
Subject
Computer Science
Year
2018
Institution
Carnegie Mellon University
Location
Pittsburgh
Degree Type
M.Math.
Subject
Computer Science
Year
2013
Institution
University of Waterloo
Location
Waterloo, Ontario, Canada
Degree Type
B. Tech.
Subject
Computer Science and Engineering
Year
2011
Institution
Indian Institute of Technology, Delhi
Location
New Delhi, India
Statement of 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, and Learning Theory.
Statement of Teaching Interests:
My teaching interests center on the design and analysis of algorithms, ranging from foundational undergraduate and graduate courses to advanced seminars on algorithms under uncertainty. I am particularly enthusiastic about covering topics such as online decision-making, randomized algorithms, machine learning, and algorithmic game theory.
Selection of recent research, scholarly, and creative activities:
Online Algorithms and Online Learning
- Secretary, Prophet, and Stochastic Probing via Big-Decisions-First
A. Rubinstein and S. Singla.
Symposium on Theory of Computing (STOC 2026)
- Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
T. Kesselheim, M. Molinaro, K. Patton, and S. Singla.
Symposium on Foundations of Computer Science (FOCS 2025)
- 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)
Algorithmic Game Theory
- Single-Sample and Robust Online Resource Allocation
R. Ghuge, S. Singla, and Y. Wang.
Symposium on Theory of Computing (STOC 2025) (video)
- 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)
Stochastic Discrete Optimization
- Online Combinatorial Optimization with Graphical Dependencies
Z. Gao, E. Gergatsouli, K. Patton, and S. Singla.
Symposium on Theory of Computing (STOC 2026)
- Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
V. Livanos, K. Patton, and S. Singla.
Conference on Economics and Computation (EC 2024) (video)
- Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
D. Segev and S. Singla.
Conference on Economics and Computation (EC 2021) (video, slides)
Mathematics of Operations Research (MOR 2025)