Aviad Rubinstein

UC Berkeley Graduate Recognized with ACM Doctoral Dissertation Award - Irish Tech News

Tel Aviv University's 2019 TAU Review by telavivuni - Issuu

Aviad Rubinstein: Beyond-X: Toward more general Prophet Inequalities and Secretary Problems

I will send an updated invoice. I am a one man operation. I will do my best to take care of YOU. At Your Service, Chitswood.

Hardness of Approximation Between P and NP by Aviad Rubinstein

Aviad Rubinstein (Stanford University) Approximate maximum matching, SETH, obfuscation, and you

Eric Budish's Academic Webpage

Stanford CS Theory

Real Analysis Seminars

ACM Books on X: In the last decade, the Nash equilibrium first presented in 1951, has found itself the subject of renewed debate. Hardness of Approximation Between P and NP, by Aviad

Association for Computing Machinery on X: Aviad Rubinstein is the recipient of the ACM 2017 Doctoral Dissertation Award for his dissertation “Hardness of Approximation Between P and NP.” In his thesis, Rubinstein

Packard Fellowships in Science and Engineering Announces New Class of Fellows in a Year of Connecting Virtually - The David and Lucile Packard Foundation