default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSahil Singla 0001
Person information
- affiliation: Georgia Tech, Atlanta, GA, USA
- affiliation (former): Princeton University, NJ, USA
Other persons with the same name
- Sahil Singla 0002 — University of Maryland, USA
- Sahil Singla 0003 — Infineon Technologies, Bangalore, India
- Sahil Singla 0004 — BITS Pilani, India
- Sahil Singla 0005 — Google Research, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j8]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. SIAM J. Comput. 53(6): 1641-1662 (2024)- [c43]Paul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, Sahil Singla:
Online Combinatorial Allocations and Auctions with Few Samples. FOCS 2024: 1231-1250 - [c42]Vasilis Livanos, Kalen Patton, Sahil Singla:
Improved Mechanisms and Prophet Inequalities for Graphical Dependencies. EC 2024: 782-805 - [c41]Sahil Singla, Yifan Wang:
Bandit Sequential Posted Pricing via Half-Concavity. EC 2024: 922-939 - [c40]Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla
, Yifan Wang:
Bandit Algorithms for Prophet Inequality and Pandora's Box. SODA 2024: 462-500 - [c39]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Supermodular Approximation of Norms and Applications. STOC 2024: 1841-1852 - [i43]Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla:
Sample Complexity of Posted Pricing for a Single Item. CoRR abs/2406.00819 (2024) - [i42]Vasilis Livanos, Kalen Patton, Sahil Singla:
Improved Mechanisms and Prophet Inequalities for Graphical Dependencies. CoRR abs/2406.05077 (2024) - [i41]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Supermodular Approximation of Norms and Applications. CoRR abs/2406.15180 (2024) - [i40]Paul Dütting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhäuser, Sahil Singla:
Online Combinatorial Allocations and Auctions with Few Samples. CoRR abs/2409.11091 (2024) - 2023
- [c38]Kalen Patton, Matteo Russo, Sahil Singla:
Submodular Norms with Applications To Online Facility Location and Stochastic Probing. APPROX/RANDOM 2023: 23:1-23:22 - [c37]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Online and Bandit Algorithms Beyond ℓp Norms. SODA 2023: 1566-1593 - [i39]Kalen Patton, Matteo Russo, Sahil Singla:
Submodular Norms with Applications To Online Facility Location and Stochastic Probing. CoRR abs/2310.04548 (2023) - [i38]Sahil Singla, Yifan Wang:
Bandit Sequential Posted Pricing via Half-Concavity. CoRR abs/2312.12794 (2023) - 2022
- [c36]Frederick Qiu, Sahil Singla:
Submodular Dominance and Applications. APPROX/RANDOM 2022: 44:1-44:21 - [c35]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. ICALP 2022: 14:1-14:12 - [c34]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. ITCS 2022: 13:1-13:22 - [c33]C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla:
Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA 2022: 1273-1297 - [c32]Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Discrepancy with Recourse for Vectors and Graphs. SODA 2022: 1356-1383 - [i37]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Smoothed Analysis of the Komlós Conjecture. CoRR abs/2204.11427 (2022) - [i36]Frederick Qiu, Sahil Singla:
Submodular Dominance and Applications. CoRR abs/2207.04957 (2022) - [i35]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Online and Bandit Algorithms Beyond 𝓁p Norms. CoRR abs/2210.13755 (2022) - [i34]Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, Yifan Wang:
Bandit Algorithms for Prophet Inequality and Pandora's Box. CoRR abs/2211.08586 (2022) - 2021
- [j7]Sahil Singla, Apurv Tiwari, Amitabha Tripathi:
Some results on the spum and the integral spum of graphs. Discret. Math. 344(5): 112311 (2021) - [c31]Anupam Gupta, Amit Kumar, Sahil Singla:
Bag-Of-Tasks Scheduling on Related Machines. APPROX-RANDOM 2021: 3:1-3:16 - [c30]Danny Segev, Sahil Singla:
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. EC 2021: 793-794 - [c29]Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. SODA 2021: 653-661 - [c28]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. SODA 2021: 2842-2861 - [c27]Maryam Bahrani, Hedyeh Beyhaghi, Sahil Singla, S. Matthew Weinberg:
Formal Barriers to Simple Algorithms for the Matroid Secretary Problem. WINE 2021: 280-298 - [i33]Anupam Gupta, Amit Kumar, Sahil Singla:
Bag-of-Tasks Scheduling on Related Machines. CoRR abs/2107.06216 (2021) - [i32]Maryam Bahrani, Hedyeh Beyhaghi, Sahil Singla, S. Matthew Weinberg:
Formal Barriers to Simple Algorithms for the Matroid Secretary Problem. CoRR abs/2111.04114 (2021) - [i31]Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Discrepancy with Recourse for Vectors and Graphs. CoRR abs/2111.06308 (2021) - [i30]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. CoRR abs/2111.07049 (2021) - [i29]C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla:
Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR abs/2112.12920 (2021) - 2020
- [j6]Sepehr Assadi, Sahil Singla:
Improved truthful mechanisms for combinatorial auctions with submodular bidders. SIGecom Exch. 18(1): 19-27 (2020) - [j5]Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-arrival Model. ACM Trans. Algorithms 16(4): 49:1-49:31 (2020) - [c26]Thomas Kesselheim, Sahil Singla:
Online Learning with Vector Costs and Bandits with Knapsacks. COLT 2020: 2286-2305 - [c25]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Carpooling Using Expander Decompositions. FSTTCS 2020: 23:1-23:14 - [c24]Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic:
Robust Algorithms for the Secretary Problem. ITCS 2020: 32:1-32:26 - [c23]Haotian Jiang, Jian Li, Daogao Liu, Sahil Singla:
Algorithms and Adaptivity Gaps for Stochastic k-TSP. ITCS 2020: 45:1-45:25 - [c22]Nicole Immorlica, Sahil Singla, Bo Waggoner:
Prophet Inequalities with Linear Correlations and Augmentations. EC 2020: 159-185 - [c21]Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha:
Online vector balancing and geometric discrepancy. STOC 2020: 1139-1152 - [p1]Anupam Gupta, Sahil Singla:
Random-Order Models. Beyond the Worst-Case Analysis of Algorithms 2020: 234-258 - [i28]Nicole Immorlica, Sahil Singla, Bo Waggoner:
Prophet Inequalities with Linear Correlations and Augmentations. CoRR abs/2001.10600 (2020) - [i27]Anupam Gupta, Sahil Singla:
Random-Order Models. CoRR abs/2002.12159 (2020) - [i26]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Carpooling using Expander Decompositions. CoRR abs/2007.10545 (2020) - [i25]Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha:
Online Discrepancy Minimization for Stochastic Arrivals. CoRR abs/2007.10622 (2020) - [i24]Danny Segev, Sahil Singla:
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. CoRR abs/2007.13121 (2020) - [i23]Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. CoRR abs/2010.01420 (2020) - [i22]Thomas Kesselheim, Sahil Singla:
Online Learning with Vector Costs and Bandits with Knapsacks. CoRR abs/2010.07346 (2020)
2010 – 2019
- 2019
- [c20]David Ellis Hershkowitz, R. Ravi, Sahil Singla:
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. APPROX-RANDOM 2019: 4:1-4:19 - [c19]Domagoj Bradac, Sahil Singla, Goran Zuzic:
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. APPROX-RANDOM 2019: 49:1-49:21 - [c18]Pravesh Kothari, Sahil Singla, Divyarthi Mohan, Ariel Schvartzman, S. Matthew Weinberg:
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries. FOCS 2019: 220-232 - [c17]Sepehr Assadi, Sahil Singla:
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. FOCS 2019: 233-248 - [c16]Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla, Sam Chiu-wai Wong:
Faster Matroid Intersection. FOCS 2019: 1146-1168 - [c15]Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla:
Non-Clairvoyant Precedence Constrained Scheduling. ICALP 2019: 63:1-63:14 - [c14]Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla:
The Markovian Price of Information. IPCO 2019: 233-246 - [i21]Domagoj Bradac, Sahil Singla, Goran Zuzic:
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. CoRR abs/1902.01461 (2019) - [i20]Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla:
The Markovian Price of Information. CoRR abs/1902.07856 (2019) - [i19]Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla:
Non-clairvoyant Precedence Constrained Scheduling. CoRR abs/1905.02133 (2019) - [i18]Pravesh Kothari, Divyarthi Mohan, Ariel Schvartzman, Sahil Singla, S. Matthew Weinberg:
Approximation Schemes for a Buyer with Independent Items via Symmetries. CoRR abs/1905.05231 (2019) - [i17]Haotian Jiang, Janardhan Kulkarni, Sahil Singla:
Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization. CoRR abs/1910.01073 (2019) - [i16]Haotian Jiang, Jian Li, Daogao Liu, Sahil Singla:
Algorithms and Adaptivity Gaps for Stochastic k-TSP. CoRR abs/1911.02506 (2019) - [i15]Sepehr Assadi, Sahil Singla:
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. CoRR abs/1911.02716 (2019) - [i14]Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic:
Robust Algorithms for the Secretary Problem. CoRR abs/1911.07352 (2019) - [i13]Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla, Sam Chiu-wai Wong:
Faster Matroid Intersection. CoRR abs/1911.10765 (2019) - [i12]Nikhil Bansal, Haotian Jiang, Sahil Singla, Makrand Sinha:
Online Vector Balancing and Geometric Discrepancy. CoRR abs/1912.03350 (2019) - 2018
- [c13]Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. ESA 2018: 57:1-57:14 - [c12]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. SODA 2018: 700-714 - [c11]Sahil Singla:
The Price of Information in Combinatorial Optimization. SODA 2018: 2523-2532 - [i11]Euiwoong Lee, Sahil Singla:
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities. CoRR abs/1806.09251 (2018) - [i10]D. Ellis Hershkowitz, R. Ravi, Sahil Singla:
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. CoRR abs/1811.11635 (2018) - 2017
- [j4]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c10]Guru Prashanth Guruganesh, Sahil Singla:
Online Matroid Intersection: Beating Half for Random Arrival. IPCO 2017: 241-253 - [c9]Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-Arrival Model. IPCO 2017: 355-367 - [c8]Aviad Rubinstein, Sahil Singla:
Combinatorial Prophet Inequalities. SODA 2017: 1671-1687 - [c7]Anupam Gupta, Viswanath Nagarajan, Sahil Singla:
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. SODA 2017: 1688-1702 - [i9]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. CoRR abs/1710.11213 (2017) - [i8]Sahil Singla:
The Price of Information in Combinatorial Optimization. CoRR abs/1711.00405 (2017) - 2016
- [j3]Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy. Math. Program. 159(1-2): 1-29 (2016) - [c6]Anupam Gupta, Viswanath Nagarajan, Sahil Singla:
Algorithms and Adaptivity Gaps for Stochastic Probing. SODA 2016: 1731-1747 - [i7]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i6]Anupam Gupta, Viswanath Nagarajan, Sahil Singla:
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. CoRR abs/1608.00673 (2016) - [i5]Aviad Rubinstein, Sahil Singla:
Combinatorial Prophet Inequalities. CoRR abs/1611.00665 (2016) - 2015
- [i4]Guru Prashanth Guruganesh, Sahil Singla:
Online Matroid Intersection: Beating Half for Random Arrival. CoRR abs/1512.06271 (2015) - 2014
- [j2]Daniel S. Berger, Philipp Gland, Sahil Singla, Florin Ciucu:
Exact analysis of TTL cache networks. Perform. Evaluation 79: 2-23 (2014) - [c5]Daniel S. Berger, Philipp Gland, Sahil Singla, Florin Ciucu:
Exact analysis of TTL cache networks: the case of caching policies driven by stopping times. SIGMETRICS 2014: 595-596 - [i3]Daniel S. Berger, Philipp Gland, Sahil Singla, Florin Ciucu:
Exact Analysis of TTL Cache Networks: The Case of Caching Policies driven by Stopping Times. CoRR abs/1402.5987 (2014) - [i2]Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy. CoRR abs/1405.0945 (2014) - 2013
- [j1]Sahil Singla, Yashar Ghiassi-Farrokhfal, Srinivasan Keshav:
Battery provisioning and scheduling for a hybrid battery-diesel generator system. SIGMETRICS Perform. Evaluation Rev. 41(3): 71-76 (2013) - [c4]Joseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla:
On Integrality Ratios for Asymmetric TSP in the Sherali-Adams Hierarchy. ICALP (1) 2013: 340-351 - [c3]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - 2012
- [c2]Tommy Carpenter, Sahil Singla, Parsiad Azimzadeh, Srinivasan Keshav:
The impact of electricity pricing schemes on storage adoption in Ontario. e-Energy 2012: 18 - [c1]Sahil Singla, Srinivasan Keshav:
Demand response through a temperature setpoint market in Ontario. SmartGridComm 2012: 103-108 - 2010
- [i1]S. K. Gupta, Sahil Singla, Akash Khandelwal, Apurv Tiwari, Srilekha:
Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs. CoRR abs/1012.5995 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-19 23:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
