Seffi Naor received his BSc in computer science in 1981 (cum laude) from the Technion - Israel Institute of Technology in Haifa, Israel; and his MSc (cum laude) in 1983 and PhD in 1987, both in computer science, from the Hebrew University of Jerusalem. He is currently a professor of computer science at the Technion, where he has been on the faculty since 1991.
Prior to that, he was a postdoctoral fellow at the University of Southern California and at Stanford University. Naor is a frequent visiting scientist at Microsoft Research. During 1998-2000 he was a member of the technical staff at Bell Laboratories, Lucent Technologies. During 2005-2007, he was a visiting researcher at Microsoft Research. Naor's research interests are mainly in the design and analysis of efficient algorithms, in particular approximation algorithms for NP-Hard algorithms and online algorithms, algorithmic game theory, and complexity theory. Naor has published over 100 papers in top professional journals and conferences. He is currently on the editorial board of Algorithmica and ACM Transactions on Algorithms.
- Theory of Reinforcement Learning, Fall 2020. Visiting Scientist.
- Online and Matching-Based Market Design, Fall 2019. Visiting Scientist.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist, Program Organizer and Workshop Organizer.
- Algorithms and Uncertainty, Fall 2016. Visiting Scientist.