Theory of Computing

Faculty

Eric Bach

Computational number theory and algebra, analysis of randomized and quantum algorithms, cryptography.

Jin-Yi Cai

Complexity theory: structural, nonuniform models, worst-case vs average-case, lattice problems.

Shuchi Chawla

Algorithms for combinatorial and stochastic optimization, game theory, hardness of approximation, privacy, learning theory.

Dieter van Melkebeek

Complexity theory: lower bounds for NP-complete problems, pseudorandomness and derandomization, quantum computing.

Alumni

  • Heng Guo, PhD 2015 › postdoc at Queen Mary University of London
  • Seeun William Umboh, PhD 2015 › postdoc at TU Eindhoven, Netherlands
  • Tyson Williams, PhD 2015 › Blocher Consulting
  • David Malec, PhD 2014 › postdoc at the University of Maryland
  • Balasubramanian (Balu) Sivan, PhD 2013 › postdoc at Microsoft Research, Redmond
  • Siddharth Barman, PhD 2012 › postdoc at the Center for the Mathematics of Information, Caltech
  • Matthew Anderson, PhD 2012 › postdoc at Cambridge University
  • Michael Kowalczyk, PhD 2010 › assistant professor at Northern Michigan University
  • Jeffrey (Jeff) Kinne, PhD 2010 › assistant professor at Indiana State University
  • Scott Diehl, PhD 2008 › assistant professor at Siena College
  • Denis Charles, PhD 2005 › postdoc at Microsoft Research, Redmond
  • Venkat Chakravarthy, PhD 2004 › IBM Research, New Delhi

Upcoming Talks

  • July 26, 2016:
    Preliminary Examination
    On the Power of Unambiguous Space Bounded Computations
    Gautam Prakriya
    2:00 PM, Room 4310
Past Talks »

Summer 2016 Courses

No courses currently.

Previously Offered Courses »