Follow
Aviad Rubinstein
Aviad Rubinstein
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
The hunting of the SNARK
N Bitansky, R Canetti, A Chiesa, S Goldwasser, H Lin, A Rubinstein, ...
Journal of Cryptology 30 (4), 989-1066, 2017
1852017
Settling the complexity of computing approximate two-player Nash equilibria
A Rubinstein
ACM SIGecom Exchanges 15 (2), 45-49, 2017
1582017
Simple mechanisms for a subadditive buyer and applications to revenue monotonicity
A Rubinstein, SM Weinberg
ACM Transactions on Economics and Computation (TEAC) 6 (3-4), 1-25, 2018
1392018
Inapproximability of Nash equilibrium
A Rubinstein
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1342015
Beyond matroids: Secretary problem and prophet inequality with general constraints
A Rubinstein
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1092016
Delegation of computation without rejection problem from designated verifier CS-proofs
S Goldwasser, H Lin, A Rubinstein
Cryptology ePrint Archive, 2011
1042011
Hardness of approximate nearest neighbor search
A Rubinstein
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
1022018
Distributed PCP theorems for hardness of approximation in P
A Abboud, A Rubinstein, R Williams
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 25-36, 2017
1012017
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
972019
Combinatorial prophet inequalities
A Rubinstein, S Singla
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
952017
Communication complexity of approximate Nash equilibria
Y Babichenko, A Rubinstein
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
872017
The complexity of fairness through equilibrium
A Othman, C Papadimitriou, A Rubinstein
ACM Transactions on Economics and Computation (TEAC) 4 (4), 1-19, 2016
742016
Optimal single-choice prophet inequalities from samples
A Rubinstein, JZ Wang, SM Weinberg
arXiv preprint arXiv:1911.07945, 2019
702019
Converting online algorithms to local computation algorithms
Y Mansour, A Rubinstein, S Vardi, N Xie
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
702012
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
642017
ETH Hardness for Densest-k-Subgraph with Perfect Completeness
M Braverman, YK Ko, A Rubinstein, O Weinstein
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
642017
Computing exact minimum cuts without knowing the graph
A Rubinstein, T Schramm, SM Weinberg
arXiv preprint arXiv:1711.03165, 2017
592017
On the complexity of dynamic mechanism design
C Papadimitriou, G Pierrakos, CA Psomas, A Rubinstein
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
532016
Constant-factor approximation of near-linear edit distance in near-linear time
J Brakensiek, A Rubinstein
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
512020
Locally adaptive optimization: Adaptive seeding for monotone submodular functions
A Badanidiyuru, C Papadimitriou, A Rubinstein, L Seeman, Y Singer
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
502016
The system can't perform the operation now. Try again later.
Articles 1–20