Aviad Rubinstein

I am a Computer Science PhD student at UC Berkeley, advised Christos Papadimitriou. In general, I am interested in Theory of Computer Science (and it applications). Lately, for example, I have been particularly curious about the complexity class PPAD, analysis of Boolean functions, and submodular maximization. Prior to coming to Berkeley I completed my MSc at Tel-Aviv University with Muli Safra.

I am co-organizing the EconCS Seminar this year.
Please email me if you would like to give a talk.

email:
      aviad [at]eecs.berkeley.edu


Selected publications

  • Abraham Othman, Christos Papadimitriou, Aviad Rubinstein: "The Complexity of Fairness through Equilibrium."
    In submission. (Arxiv)
  • Adi Livnat, Christos Papadimitriou, Aviad Rubinstein, Andrew Wan: "Satisfiability and Evolution."
    Manuscript. (Arxiv)
  • Ilan Adler, Christos Papadimitriou, Aviad Rubinstein: "On Simplex Pivoting Rules and Complexity Theory."
    IPCO 2014, to appear.

Department of Electrical Engineering and Computer Sciences
University of California at Berkeley

Last updated 3/14