| The adaptive complexity of maximizing a submodular function E Balkanski, Y Singer Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 41 | 2018 |
| The limitations of optimization from samples E Balkanski, A Rubinstein, Y Singer Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 38 | 2017 |
| An exponential speedup in parallel running time for submodular maximization without loss in approximation E Balkanski, A Rubinstein, Y Singer Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 35 | 2019 |
| The power of optimization from samples E Balkanski, A Rubinstein, Y Singer Advances in Neural Information Processing Systems, 4017-4025, 2016 | 24 | 2016 |
| Non-monotone submodular maximization in exponentially fewer iterations E Balkanski, A Breuer, Y Singer Advances in Neural Information Processing Systems, 2353-2364, 2018 | 22 | 2018 |
| Bayesian budget feasibility with posted pricing E Balkanski, JD Hartline Proceedings of the 25th International Conference on World Wide Web, 189-203, 2016 | 20 | 2016 |
| Simultaneous Cake Cutting. E Balkanski, S Brânzei, D Kurokawa, AD Procaccia AAAI, 566-572, 2014 | 16 | 2014 |
| Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization. E Balkanski, B Mirzasoleiman, A Krause, Y Singer ICML, 2207-2216, 2016 | 14 | 2016 |
| Approximation guarantees for adaptive sampling E Balkanski, Y Singer International Conference on Machine Learning, 384-393, 2018 | 13 | 2018 |
| An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model E Balkanski, A Rubinstein, Y Singer Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 11 | 2019 |
| Parallelization does not accelerate convex optimization: Adaptivity lower bounds for non-smooth convex minimization E Balkanski, Y Singer arXiv preprint arXiv:1808.03880, 2018 | 11 | 2018 |
| Statistical cost sharing E Balkanski, U Syed, S Vassilvitskii Advances in Neural Information Processing Systems, 6221-6230, 2017 | 11 | 2017 |
| The importance of communities for learning to influence E Balkanski, N Immorlica, Y Singer Advances in Neural Information Processing Systems, 5862-5871, 2017 | 10 | 2017 |
| Learning to optimize combinatorial functions N Rosenfeld, E Balkanski, A Globerson, Y Singer International Conference on Machine Learning, 4374-4383, 2018 | 9 | 2018 |
| Partial word DFAs E Balkanski, F Blanchet-Sadri, M Kilgore, BJ Wyatt International Conference on Implementation and Application of Automata, 36-47, 2013 | 7 | 2013 |
| The sample complexity of optimizing a convex function E Balkanski, Y Singer Conference on Learning Theory, 275-301, 2017 | 6 | 2017 |
| Minimizing a submodular function from samples E Balkanski, Y Singer Advances in Neural Information Processing Systems, 814-822, 2017 | 6 | 2017 |
| Mechanisms for fair attribution E Balkanski, Y Singer Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 5 | 2015 |
| A lower bound for parallel submodular minimization E Balkanski, Y Singer Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 1 | 2020 |
| On the Construction of Substitutes E Balkanski, R Paes Leme Mathematics of Operations Research 45 (1), 272-291, 2020 | 1 | 2020 |
Yaron SingerHarvard UniversityVerified email at seas.harvard.edu
