The Algorithms & Theory group works to understand the theoretical foundations of fundamental areas in computer science, and uses these theoretical insights to produce novel practical algorithms.  Our research covers a wide variety of topics in theoretical computer science and related areas, including complexity theory, distributed algorithms, networking, constraint satisfaction, information theory (classical and quantum), cryptography, computational learning theory, graph theory, game theory, and security.

 

Research areas include:

  • Algorithmic fairness and transparency
  • Complexity theory
  • Constraint satisfaction
  • Cryptography
  • Distributed algorithms
  • Graph theory and algorithms
  • Information Theory and Coding
  • Learning theory
  • Networking
  • Privacy and security
  • Quantum information