School of Computing and Informatics

Algorithms and Theory Research

The algorithms and theory group conducts research in areas ranging from applied algorithms to fundamental research on the limits of computing. Our applied research focuses on combinatorial design and its application to hardware and software design. Application areas also include the use of algorithmic techniques for computational biology. Fundamental research in algorithms addresses graph algorithms as well as search techniques and approximation algorithms. Our research includes resource localization, routing, caching, and streaming algorithms for networks, in addition to combinatorial design theory, security issues, and fault tolerance in sensor networks and distributed systems.

Overview Presentation (Adobe PDF)

Faculty Contacts: Rida Bazzi, Charles Colbourn, Goran Konjevod, Seungchan Kim, Andrea Richa, Arun Sen, Guoliang Xue