This lecture series honors Paris Kanellakis, a distinguished computer scientist who was an esteemed and beloved member of Brown CS. Paris joined us in 1981 and became a full professor in 1990. His research area was theoretical computer science, with an emphasis on the principles of database systems, logic in computer science, the principles of distributed computing, and combinatorial optimization.
The 2018 lecture will be announced later in the year.
To watch the recording of a lecture or read its abstract, click its title.
|2017||Below P vs. NP: Conditional Quadratic-Time Hardness for Big Data Problems||Piotr Indyk (MIT)|
|2016||Donald Knuth (Stanford)|
Shafi Goldwasser (MIT)
Daniel Spielman (Yale)
Jon Kleinberg (Cornell)
Cynthia Dwork (Microsoft)
Andrew Yao (Tsinghua University)
Moshe Vardi (Rice University)
|2009||John C. Mitchell (Stanford)|
|2008||Anna Karlin (University of Washington)|
|2006||Eugene Myers (Howard Hughes Medical Institute)|
|2005||Richard Karp (UC Berkeley)|
Michael Rabin (Harvard)
Reconfigurable Atomic Memory for Dynamic Networks
|Nancy Lynch (MIT- delivered by Alex Shvartsman)|
|2002||Christos Papadimitriou (UC Berkeley)|
|2001||Mihalis Yannakakis (Avaya Laboratories)|