default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Balkanski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Eric Balkanski
, Yuri Faenza, Mathieu Kubik:
The simultaneous semi-random model for TSP. Math. Program. 206(1): 305-332 (2024)- [i26]Eric Balkanski, Noémie Périvier, Clifford Stein, Hao-Ting Wei:
Energy-Efficient Scheduling with Predictions. CoRR abs/2402.17143 (2024) - [i25]Eric Balkanski, Steven DiSilvio, Alan Kuhnle:
Submodular Maximization in Exactly n Queries. CoRR abs/2406.00148 (2024) - [i24]Eric Balkanski, Christopher En, Yuri Faenza:
An Algorithm for the Assignment Game Beyond Additive Valuations. CoRR abs/2406.13620 (2024) - [i23]Eric Balkanski, Vasilis Gkatzelis, Golnoosh Shahkarami:
Randomized Strategic Facility Location with Predictions. CoRR abs/2409.07142 (2024) - 2023
- [c32]Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan:
Strategyproof Scheduling with Predictions. ITCS 2023: 11:1-11:22 - [c31]Eric Balkanski, Noémie Périvier, Clifford Stein, Hao-Ting Wei:
Energy-Efficient Scheduling with Predictions. NeurIPS 2023 - [c30]Eric Balkanski, Yuri Faenza, Noémie Périvier:
The Power of Greedy for Online Minimum Cost Matching on the Line. EC 2023: 185-205 - [c29]Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei:
Scheduling with Speed Predictions. WAOA 2023: 74-89 - [i22]Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan, Cherlin Zhu:
Online Mechanism Design with Predictions. CoRR abs/2310.02879 (2023) - [i21]Arpit Agarwal, Eric Balkanski:
Learning-Augmented Dynamic Submodular Maximization. CoRR abs/2311.13006 (2023) - 2022
- [j4]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model. Oper. Res. 70(5): 2967-2981 (2022) - [j3]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The Limitations of Optimization from Samples. J. ACM 69(3): 21:1-21:33 (2022) - [c28]Eric Balkanski, Oussama Hanguir, Shatian Wang:
Learning Low Degree Hypergraphs. COLT 2022: 419-420 - [c27]Eric Balkanski, Yuri Faenza, Mathieu Kubik:
The Simultaneous Semi-random Model for TSP. IPCO 2022: 43-56 - [c26]Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou, Xizhi Tan:
Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. EC 2022: 497-528 - [c25]Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Deterministic Budget-Feasible Clock Auctions. SODA 2022: 2940-2963 - [i20]Eric Balkanski, Oussama Hanguir, Shatian Wang:
Learning Low Degree Hypergraphs. CoRR abs/2202.09989 (2022) - [i19]Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou, Xizhi Tan:
Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. CoRR abs/2204.01120 (2022) - [i18]Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei:
Scheduling with Speed Predictions. CoRR abs/2205.01247 (2022) - [i17]Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan:
Strategyproof Scheduling with Predictions. CoRR abs/2209.04058 (2022) - [i16]Eric Balkanski, Yuri Faenza, Noémie Périvier:
The Power of Greedy for Online Minimum Cost Matching on the Line. CoRR abs/2210.03166 (2022) - 2021
- [c24]Eric Balkanski, Sharon Qian, Yaron Singer:
Instance Specific Approximations for Submodular Maximization. ICML 2021: 609-618 - [c23]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Robust Repeated First Price Auctions. EC 2021: 4 - [i15]Eric Balkanski, Sharon Qian, Yaron Singer:
Instance Specific Approximations for Submodular Maximization. CoRR abs/2102.11911 (2021) - [i14]Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan:
Deterministic Budget-Feasible Clock Auctions. CoRR abs/2107.09239 (2021) - 2020
- [j2]Eric Balkanski, Renato Paes Leme:
On the Construction of Substitutes. Math. Oper. Res. 45(1): 272-291 (2020) - [c22]Adam Breuer, Eric Balkanski, Yaron Singer:
The FAST Algorithm for Submodular Maximization. ICML 2020: 1134-1143 - [c21]Ron Kupfer, Sharon Qian, Eric Balkanski, Yaron Singer:
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation. NeurIPS 2020 - [c20]Eric Balkanski, Yaron Singer:
A lower bound for parallel submodular minimization. STOC 2020: 130-139 - [i13]Eric Balkanski, Harrison Chase, Kojin Oshiba, Alexander Rilee, Yaron Singer, Richard Wang:
Adversarial Attacks on Binary Image Recognition Systems. CoRR abs/2010.11782 (2020)
2010 – 2019
- 2019
- [c19]Sepehr Assadi, Eric Balkanski, Renato Paes Leme:
Secretary Ranking with Minimal Inversions. NeurIPS 2019: 1049-1061 - [c18]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation. SODA 2019: 283-302 - [c17]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. STOC 2019: 66-77 - [i12]Shipra Agrawal, Eric Balkanski, Vahab S. Mirrokni, Balasubramanian Sivan:
Dynamic First Price Auctions Robust to Heterogeneous Buyers. CoRR abs/1906.03286 (2019) - [i11]Adam Breuer, Eric Balkanski, Yaron Singer:
The FAST Algorithm for Submodular Maximization. CoRR abs/1907.06173 (2019) - 2018
- [c16]Eric Balkanski, Yaron Singer:
Approximation Guarantees for Adaptive Sampling. ICML 2018: 393-402 - [c15]Nir Rosenfeld, Eric Balkanski, Amir Globerson, Yaron Singer:
Learning to Optimize Combinatorial Functions. ICML 2018: 4371-4380 - [c14]Eric Balkanski, Adam Breuer, Yaron Singer:
Non-monotone Submodular Maximization in Exponentially Fewer Iterations. NeurIPS 2018: 2359-2370 - [c13]Eric Balkanski, Renato Paes Leme:
On the Construction of Substitutes. EC 2018: 643 - [c12]Eric Balkanski, Yaron Singer:
The adaptive complexity of maximizing a submodular function. STOC 2018: 1138-1151 - [i10]Eric Balkanski, Nicole Immorlica, Yaron Singer:
The Importance of Communities for Learning to Influence. CoRR abs/1801.07355 (2018) - [i9]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation. CoRR abs/1804.06355 (2018) - [i8]Eric Balkanski, Renato Paes Leme:
On the Construction of Substitutes. CoRR abs/1805.03726 (2018) - [i7]Eric Balkanski, Adam Breuer, Yaron Singer:
Non-monotone Submodular Maximization in Exponentially Fewer Iterations. CoRR abs/1807.11462 (2018) - [i6]Eric Balkanski, Yaron Singer:
Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization. CoRR abs/1808.03880 (2018) - [i5]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model. CoRR abs/1811.03093 (2018) - [i4]Sepehr Assadi, Eric Balkanski, Renato Paes Leme:
Secretary Ranking with Minimal Inversions. CoRR abs/1811.06444 (2018) - 2017
- [c11]Eric Balkanski, Yaron Singer:
The Sample Complexity of Optimizing a Convex Function. COLT 2017: 275-301 - [c10]Eric Balkanski, Yaron Singer:
Minimizing a Submodular Function from Samples. NIPS 2017: 814-822 - [c9]Eric Balkanski, Nicole Immorlica, Yaron Singer:
The Importance of Communities for Learning to Influence. NIPS 2017: 5862-5871 - [c8]Eric Balkanski, Umar Syed, Sergei Vassilvitskii:
Statistical Cost Sharing. NIPS 2017: 6221-6230 - [c7]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The limitations of optimization from samples. STOC 2017: 1016-1027 - [i3]Eric Balkanski, Umar Syed, Sergei Vassilvitskii:
Statistical Cost Sharing. CoRR abs/1703.03111 (2017) - 2016
- [c6]Eric Balkanski, Baharan Mirzasoleiman, Andreas Krause, Yaron Singer:
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization. ICML 2016: 2207-2216 - [c5]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The Power of Optimization from Samples. NIPS 2016: 4017-4025 - [c4]Eric Balkanski, Jason D. Hartline:
Bayesian Budget Feasibility with Posted Pricing. WWW 2016: 189-203 - 2015
- [j1]Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
On the state complexity of partial word DFAs. Theor. Comput. Sci. 578: 2-12 (2015) - [c3]Eric Balkanski, Yaron Singer:
Mechanisms for Fair Attribution. EC 2015: 529-546 - [i2]Eric Balkanski, Jason D. Hartline:
Bayesian Budget Feasibility with Posted Pricing. CoRR abs/1506.04198 (2015) - [i1]Eric Balkanski, Aviad Rubinstein, Yaron Singer:
The Limitations of Optimization from Samples. CoRR abs/1512.06238 (2015) - 2014
- [c2]Eric Balkanski, Simina Brânzei, David Kurokawa, Ariel D. Procaccia:
Simultaneous Cake Cutting. AAAI 2014: 566-572 - 2013
- [c1]Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
Partial Word DFAs. CIAA 2013: 36-47
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-10-15 00:24 CEST 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:
