Home   Contact Research:   Publications   Events   Problem session   Seminars People:   Faculty members   Graduate students   Postdoctoral fellows   Alumni   Postdoctoral positions Prospective Students:   Admission   Life at Waterloo   International Students

The Algorithm and Complexity Group is a research group in the School of Computer Science at University of Waterloo. You can subscribe to a mailing list for Algorithms and Complexity announcements (for Faculty, Students, or Postdocs, visitors and others.) Research Overview: The research group is very active, with a weekly seminar and various other regular meetings, such as the problem solving session, where research problems are posed and solved with students, and the discussion group, where techniques and problems from published papers are discussed. The research group is one of the largest of the school, with 16 faculty members, 10 faculty with related research interests, and more than 40 graduate students. The topics in theoretical computer science studied at Waterloo within the Algorithms and Complexity group cover a very broad scope. They can be loosely categorized into two major areas: Design and analysis of algorithms The design and analysis of algorithms on general-purpose models of computation draws inspiration from basic building-block problems (data structures, graph theory and graph-theoretic algorithms), problems in other areas of computer science (theory of programming languages, program methodology, theory of databases, learning theory, VLSI theory, information retrieval, cryptography, quantum computing, robot motion planning), and from computational problems arising in other disciplines (computational biology, algorithmic number theory, computational geometry). Models of computation and computational complexity Defining special models of computation and using mathematical tools to demonstrate the consequences of those definitions (as is done in formal languages, theory of automata, structural and computational complexity, parameterized complexity, theory of asynchronous circuits and hardware testing, parallel computation, Kolmogorov complexity) can lead to new insights into particular problems, or into the structure of a whole class of problems.