|
Theoretical Computer Science |
|
Welcome to Theoretical Computer Science at Brown.
Faculty members
We are proud to have a Gödel prize winner and ACM fellow (Maurice Herlihy), and three ACM and IEEE fellows (Franco Preparata, John Savage and Eli Upfal).
Maurice Herlihy: Distributed and parallel computing Sorin Istrail: Computational biology, algorithms Philip Klein: Algorithms on graphs and networks Anna Lysyanskaya: Cryptography Claire Mathieu: Algorithms Franco Preparata: Combinatorial computing, algorithms, computational biology John Savage: Nanotechnology Eli Upfal: Algorithms, probability and applications
Faculty friends
Faculty members with a friendly interest in Theory Amy Greenwald: Artificial intelligence Ben Raphael: Computational biology Roberto Tamassia: Security
Postdocs
Current PhD students
Graduated PhDs (since 2006)Glencora Borradaile (PhD 2007). Oregon State University, assistant professor. Aris Anagnostopoulos (PhD 2006). La Sapienza, Rome. Mira Belenkiy (nee Meyerovich) (PhD 2008). MSR Redmond. Melissa Chase (PhD 2008). MSR Redmond. Aparna Das (PhD 2010). University of Arizona, postdoc. Alptekin Küpçü (PhD 2010). Koç University Computer Engineering Department. Yossi Lev (PhD 2010). Sun Labs research. Eric Rachlin (PhD 2010). Brown University, postdoc. Warren Schudy (PhD 2010). IBM Research, postdoc.
Seminars
The CS department distinguished speaker series often includes speakers of particular interest to Theory. We also run a weekly Theory lunch and colloquium.
Courses
Lower level undergraduate courses CS 22: Introduction to discrete structures and probability CS 51: Models of computation CS 53: The Matrix in computer science Upper level undergraduate and First year graduate level courses CS 149: Introduction to combinatorial optimization CS 151: Introduction to cryptography and computer security CS 155: Probabilistic methods in computer science CS 157: Design and analysis of algorithms CS 158: Information retrieval and web search CS 159: Introduction to computational complexity CS 195-J: Introduction to computational geometry CS 195-M: Advanced practical combinatorial optimization Graduate courses CS 250-A: Advanced algorithms CS 250-B: Optimization algorithms on planar graphs CS 251: Approximation algorithms CS 253: Internet and web algorithms CS 254: Advanced probabilistic methods in computer science CS 255: Parallel computation CS 256: Applied theory of computation CS 257: Introduction to nanocomputing CS 259: Advanced topics in cryptography CS 275: Topics in parallel and distributed computing
|
