Sahil Singla

Orcid: 0000-0002-8800-6479

Affiliations:
  • Georgia Tech, Atlanta, GA, USA
  • Princeton University, NJ, USA (former)


According to our database1, Sahil Singla authored at least 50 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Bandit Sequential Posted Pricing via Half-Concavity.
CoRR, 2023

Online and Bandit Algorithms Beyond ℓ<sub><i>p</i></sub> Norms.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Submodular Norms with Applications To Online Facility Location and Stochastic Probing.
Proceedings of the Approximation, 2023

2022
Bandit Algorithms for Prophet Inequality and Pandora's Box.
CoRR, 2022

Online and Bandit Algorithms Beyond 𝓁<sub>p</sub> Norms.
CoRR, 2022

Online Discrepancy with Recourse for Vectors and Graphs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Robust Secretary and Prophet Algorithms for Packing Integer Programs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Smoothed Analysis of the Komlós Conjecture.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Submodular Dominance and Applications.
Proceedings of the Approximation, 2022

2021
Some results on the spum and the integral spum of graphs.
Discret. Math., 2021

Formal Barriers to Simple Algorithms for the Matroid Secretary Problem.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Online Discrepancy Minimization for Stochastic Arrivals.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Efficient Approximation Schemes for Stochastic Probing and Prophet Problems.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Bag-Of-Tasks Scheduling on Related Machines.
Proceedings of the Approximation, 2021

2020
Maximum Matching in the Online Batch-arrival Model.
ACM Trans. Algorithms, 2020

Improved truthful mechanisms for combinatorial auctions with submodular bidders.
SIGecom Exch., 2020

Random-Order Models.
CoRR, 2020

Online vector balancing and geometric discrepancy.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Prophet Inequalities with Linear Correlations and Augmentations.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Algorithms and Adaptivity Gaps for Stochastic k-TSP.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Robust Algorithms for the Secretary Problem.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Online Carpooling Using Expander Decompositions.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Online Learning with Vector Costs and Bandits with Knapsacks.
Proceedings of the Conference on Learning Theory, 2020

Random-Order Models.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019
Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization.
CoRR, 2019

Approximation Schemes for a Buyer with Independent Items via Symmetries.
CoRR, 2019

The Markovian Price of Information.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Non-Clairvoyant Precedence Constrained Scheduling.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Faster Matroid Intersection.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty.
Proceedings of the Approximation, 2019

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing.
Proceedings of the Approximation, 2019

2018
The Price of Information in Combinatorial Optimization.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Prophet Secretary for Combinatorial Auctions and Matroids.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
How to Morph Planar Graph Drawings.
SIAM J. Comput., 2017

Combinatorial Prophet Inequalities.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Online Matroid Intersection: Beating Half for Random Arrival.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy.
Math. Program., 2016

Algorithms and Adaptivity Gaps for Stochastic Probing.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2014
Exact analysis of TTL cache networks.
Perform. Evaluation, 2014

Exact analysis of TTL cache networks: the case of caching policies driven by stopping times.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

2013
Battery provisioning and scheduling for a hybrid battery-diesel generator system.
SIGMETRICS Perform. Evaluation Rev., 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Demand response through a temperature setpoint market in Ontario.
Proceedings of the IEEE Third International Conference on Smart Grid Communications, 2012

The impact of electricity pricing schemes on storage adoption in Ontario.
Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, 2012

2010
Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs
CoRR, 2010


  Loading...