Aviad Rubinstein

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

John J. Jack Walklet III Obituary

Alexandros Psomas, Aranyak Mehta, Uri Nadav, Aviad Rubinstein · Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics · SlidesLive

Aviad Rubinstein (@AviadRubinstein) / X

Algorithms and Complexity Seminar

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

Jabari Hastings

Aviad Rubinstein's research works Stanford University, CA (SU) and other places

Siu On Chan

Aviad Rubinstein: Distributed PCP theorems for hardness of approximation in P

Xiaorui Sun's Homepage

Guy Rubinstein - Managing Director - Aveeram Wind Limitd, WWS Renewables

(Almost) all the content of an undergraduate algorithms course, in 24 rhyming and colorfully illustrated pages!

Algorithms for Toddlers|Hardcover

Aviad Rubinstein (@AviadRubinstein) / X

Elyakim Rubinstein - Wikipedia