Rubinstein, Aviad

Eric Balkanski, Aviad Rubinstein, and Yaron Singer. 2019. “An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.” In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 . Download

Eric Balkanski, Aviad Rubinstein, and Yaron Singer. 2017. “The Limitations of Optimization from Samples.” In ACM Symposium on the Theory of Computing (STOC 2017). Download

Eric Balkanski, Aviad Rubinstein, and Yaron Singer. 2016. “The Power of Optimization from Samples.” In Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2016. Download

Ashwinkumar Badanidiyuru, Christos Papadimitriou, Aviad Rubinstein, Lior Seeman, and Yaron Singer. 2016. “Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions.” In ACM-SIAM Symposium on Discrete Algorithms (SODA), Pp. 414-429. Download

Aviad Rubinstein, Lior Seeman, and Yaron Singer. 2015. “Approximability of Adaptive Seeding under Knapsack Constraints.” In The ACM Conference on Economics and Computation (EC) 2015, Pp. 797-814. Download