Follow
Sahil Singla
Sahil Singla
Assistant Professor, School of Computer Science, Georgia Tech
Verified email at gatech.edu - Homepage
Title
Cited by
Cited by
Year
Exact analysis of TTL cache networks
DS Berger, P Gland, S Singla, F Ciucu
Performance Evaluation 79, 2-23, 2014
151*2014
Prophet secretary for combinatorial auctions and matroids
S Ehsani, MT Hajiaghayi, T Kesselheim, S Singla
Proceedings of the twenty-ninth annual acm-siam symposium on discrete …, 2018
1222018
Combinatorial prophet inequalities
A Rubinstein, S Singla
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
922017
The Price of Information in Combinatorial Optimization
S Singla
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
692018
Algorithms and adaptivity gaps for stochastic probing
A Gupta, V Nagarajan, S Singla
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
682016
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities
E Lee, S Singla
European Symposium on Algorithms, 57:1-57:14, 2018
672018
Adaptivity gaps for stochastic probing: Submodular and XOS functions
A Gupta, V Nagarajan, S Singla
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
662017
The impact of electricity pricing schemes on storage adoption in ontario
T Carpenter, S Singla, P Azimzadeh, S Keshav
Proceedings of the 3rd International Conference on Future Energy Systems …, 2012
612012
How to morph planar graph drawings
S Alamdari, P Angelini, F Barrera-Cruz, TM Chan, GD Lozzo, GD Battista, ...
SIAM Journal on Computing 46 (2), 824-852, 2017
452017
Online Vector Balancing and Geometric Discrepancy
N Bansal, H Jiang, S Singla, M Sinha
Proceedings of the 52nd Annual ACM-SIGACT Symposium on Theory of Computing …, 2020
372020
Morphing planar graph drawings with a polynomial number of steps
S Alamdari, P Angelini, TM Chan, G Di Battista, F Frati, A Lubiw, ...
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
372013
Improved truthful mechanisms for combinatorial auctions with submodular bidders
S Assadi, S Singla
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019
342019
Random-Order Models
A Gupta, S Singla
Beyond the Worst-Case Analysis of Algorithms, 234-258, 2020
302020
Online discrepancy minimization for stochastic arrivals
N Bansal, H Jiang, R Meka, S Singla, M Sinha
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
292021
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
P Kothari, D Mohan, A Schvartzman, S Singla, SM Weinberg
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
292019
Online Matroid Intersection: Beating Half for Random Arrival
GP Guruganesh, S Singla
International Conference on Integer Programming and Combinatorial Optimization, 2017
292017
Efficient approximation schemes for stochastic probing and prophet problems
D Segev, S Singla
Proceedings of the 22nd ACM Conference on Economics and Computation, 793-794, 2021
282021
Faster matroid intersection
D Chakrabarty, YT Lee, A Sidford, S Singla, SC Wong
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
272019
The Markovian Price of Information
A Gupta, H Jiang, Z Scully, S Singla
International Conference on Integer Programming and Combinatorial …, 2019
272019
Maximum matching in the online batch-arrival model
E Lee, S Singla
ACM Transactions on Algorithms (TALG) 16 (4), 1-31, 2020
252020
The system can't perform the operation now. Try again later.
Articles 1–20