Omer Reingold, June 2019 My research is focused on a wide range of topics within the Foundations of Computer Science. Some of my most significant contributions are in Computational Complexity and the Foundations of Cryptography, with an emphasis on Randomness, Derandomization and Explicit Combinatorial Constructions. Much of my current work is in Algorithmic Fairness. Current Academic Employment: The Rajeev Motwani Professor of Computer Science, Stanford University. In Stanford since September. 2016. Education: • 1994-1998 Weizmann Institute of Science, Rehovot, Israel. Ph.D. in Computer Science. Thesis title: Pseudo-random synthesizers, functions and permutations. Advisor: Prof. Moni Naor. • 1991-1994 Tel-Aviv University, Tel-Aviv, Israel. B.Sc in Mathematics and Computer Science - Summa Cum Laude. Selected Awards and distinctions (additional awards below): • The 2009 Gödel Prize for outstanding papers in the area of theoretical computer science (jointly with Salil Vadhan and Avi Wigderson). • 2005 ACM Grace Murray Hopper Award. Awarded by the Association for Computing Machinery (ACM) to “the outstanding young computer professional of the year.” • ACM Fellow (2014) Previous Academic Employment and Short Term Visits: • Feb 2015 – September 2016 Principal Research Engineer, Samsung Research America (SRA) • Nov 2014 – Feb 2015 (while on leave from Weizmann) Visiting Professor, Computer Science, Stanford University • July 2009 – Nov 2014 (while on leave from Weizmann) Principal Researcher, Microsoft Research Silicon Valley, Mountain View, CA, USA • Jan 2004 – June 2015 Professor (full Professor since October 2011), Faculty of Mathematics and Computer Science, Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science On sabbatical and leave of absence July 2009 – June 2015 • August 17 – November 15, 2005 Visiting scholar, Center for Research on Computation and Society, Division of Engineering and Applied Sciences, Harvard University. • 1999 – 2004 Senior technical staff member, Department of Secure Systems Research, AT&T Labs – Research, Florham Park, NJ, USA. • 1999 – 2004 (Concurrent to my employment at AT&T) Visiting member of the333 School of Mathematics, Institute for Advanced Study, Princeton, NJ, USA. • 1998 – 1999 Postdoctoral fellow, Dept. of Applied Math and Computer Science, Weizmann Institute of Science, Rehovot, Israel. Advisor: Prof. Adi Shamir. Professional Activities (partial list): • Director, CS MS program, Stanford • Steering Committee chair: International Conference on Randomization and Computation (RANDOM) • Steering Committee: Innovations in Theoretical Computer Science (ITCS) • Scientific Advisory Board (SAB) of the Simons Institute • Editorial Board: SIAM Journal on Computing (SICOMP) (retired 2016) • Editorial Board: IACR Journal of Cryptology (retired 2016) • Editorial Board: ACM Transactions on Computation Theory (ToCT) (retired 2016) • Guest Editor: Special Issue of Approx-Random 2007, Algorithmica, Springer. • Scientific Board: Electronic Colloquium on Computational Complexity (ECCC) • Chair of program committee: FOCS 2013, CCC 2011, TCC 2009, Random 2007 • Served on the program committee of CRYPTO 2001 and RANDOM 2001, FOCS 2002, TCC 2004, EUROCRYPT 2004, ICALP 2005, FOCS 2005, TCC 2007, CRYPTO 2007, STOC 2008, CCC 2010, ITCS 2016. • Co-founding and organizing the group research blogs `Theory Dish’ (Stanford, May 2017) and `Windows On Theory’ (Microsoft Research, April 2012) as forums for exchanging ideas and debating topics of interest to the Theory of Computing (TOC) community. Contributing both technical and non-technical posts and in particular, initiating the research life stories project. • SIGACT Research Highlights Committee, 2019 • Gödel Prize committee 2017-2019 (last year as chair) • Co-organizing TOCA-SV meetings of the Sillicon-Valley Theory Community (starting in November 2016) • Co-Organizing the first ACM-SRC University competition (hosted by MSR-SVC and the Simons Institute), 2013 • Co-Director, Research School of Mathematics and Computer Science, Weizmann Institute (2007 - 2009). Other Awards and Fellowships (by reversed chronologic order): • 2015 IBM Pat Goldberg Memorial Best Paper Award (for the paper “The reusable holdout: Preserving validity in adaptive data analysis Science Magazine”, joint with Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi) • 2011 Helen and Martin Kimmel Award for Innovative Investigation • 2011 SIAM (Society for Industrial and Applied Mathematics) Outstanding Paper Prize, for the paper "Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function", joint with Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, and Salil Vadhan • The 2006 Prof. Pazy Memorial Research Award, given annually to the most outstanding and original BSF supported project in mathematics and computer science (awarded for my BSF grant joint with Prof. Luca Trevisan and Prof. Salil Vadhan). • 2007 Morris L. Levinson Prize in Mathematics awarded yearly by the Scientific Council of the Weizmann Institute to a single member of the Weizmann Institute. • CRYPTO 2006 best paper award for the paper “On the Power of the Randomized Iterate” (joint with Iftach Haitner and Danny Harnik). • ICALP 2006, track C, best paper award for the paper “Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions” (joint with Iftach Haitner and Danny Harnik). • STOC 2005 best paper award for the paper “Undirected ST-connectivity in log- space”. • Rothschild award for postdoctoral studies, 1999. Awarded yearly by Yad-Hanadiv, Jerusalem, Israel to up to eighteen Israeli students of all areas, for postdoctoral studies abroad. • J. F. Kennedy prize for achievements in Ph.D. studies, 1999. Awarded yearly by the Weizmann Institute of Science, Israel to four Ph.D. students of the Weizmann Institute. • Levi Eshkol scholarship for postdoctoral studies, 1998, Israel. Awarded by the ministry of science to students of Israeli universities. • The Dimitris N. Chorafas foundation prize for engineering and technology, 1998, Switzerland. Awarded yearly to 20-30 students of 26 “partner universities.” • Clore scholars award for Ph.D. studies, 1996, Israel. Awarded yearly to ten students of Israeli universities, in all fields of the natural sciences, including mathematics, physics, chemistry, the life sciences, earth sciences, agriculture, engineering and technology. • Undergraduate studies in the Excelling Program, Tel-Aviv University, Israel. • Yekutiel Federman scholarship, 1992, Israel. • Dean's honors lists, Tel-Aviv University, 1991-1994, Israel. Interns, Students, and Postdoctoral fellows: • Benjamin Plaut, Current PhD student, Stanford, co-advised with Ashish Goel • Brian Axelrod, Current PhD student, Stanford, co-advised with Greg Valiant • Michael P. Kim, Current PhD student, Stanford • Huacheng Yu (PhD Stanford, Stanford, co-advising with Ryan Williams during his final quarters) • Amir Abboud (PhD Stanford, Stanford, co-advising with Virginia Williams during his final quarters) • Ron Rothblum, MSR-SV Summer Intern, 2013 • Kat Ellis, MSR-SV Summer Intern, 2013, 2014 • Raghu Meka, MSR-SV Summer Intern, 2011 • Shubhangi Saraf, MSR-SV Summer Intern, 2010 • Shachar Lovett, Ph.D., Weizmann, started 2006, completed 2010 • Ronen Gradwohl, direct Ph.D., Weizmann, started 2004, completed 2009. • Iftach Haitner, Ph.D., Weizmann, started 2004, completed 2008. • Eyal Rozenman, Postdoctoral fellow, Weizmann, year of 2004/2005. • Sergey Novikov, Masters, Weizmann, started 2008. • Klim Efremenko, Masters, Weizmann, started 2007, completed 2008. • Tal Kramer, Masters, Weizmann, started 2006, completed 2007. • Michal Igell, Masters, Weizmann, started 2004, completed 2005. Publication List: Each of my publications appears only once in this list. In case a paper was published both in a conference and in a journal, then usually the journal reference will appear first, directly followed by reference to the preliminary version. Author’s order for all papers is alphabetical as customary in my field. Publications appear in chronological order according to date of first publication: 1. M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudorandom functions, Journal of Computer and System Sciences (JCSS), 58(2), pp. 336-375, 1999. Preliminary Version: Proc. 36th IEEE Symp. of Foundations of Computer Science (FOCS 1995), pp. 170-181, 1995. 2. M. Naor and O. Reingold, On the construction of pseudorandom permutations: Luby- Rackoff revisited, J. of Cryptology, vol. 12, pp. 29-66, 1999. Preliminary Version: Proc. 29th Ann. ACM Symp. on Theory of Computing, (STOC 1997), pp. 189-199, 1997. 3. M. Naor and O. Reingold, Number-Theoretic constructions of efficient pseudorandom functions, J. ACM vol. 51(2), pp. 231-262, 2004. Preliminary Version: Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS 1997), pp.458-467, 1997. 4. R. Canetti, D. Micciancio and O. Reingold, Perfectly one-way probabilistic hash functions, Proc. 30th Ann. ACM Symp. on Theory of Computing (STOC 1998), pp. 131- 140, 1998. 5. M. Naor and O. Reingold, From unpredictability to indistinguishability: A simple construction of pseudorandom functions from MACs, Advances in Cryptology - CRYPTO 1998, pp. 267-282, 1998. 6. E. Biham, D. Boneh and O. Reingold, Breaking generalized Diffie-Hellmann modulo a composite is no easier than factoring, Information Processing Letters 70(2), pp. 83-87, 1999. 7. R. Raz and O. Reingold, On recycling