Welcome to the ACO Program Home Page This is the home page for the program in Algorithms, Combinatorics and Optimization at Carnegie Mellon University.

More About the Program	Admission/Application Information
Ph.D. Program Requirements	ACO Seminar

Faculty

Egon Balas	Polyhedral combinatorics, combinatorial optimization.
Guy Blelloch	Parallel algorithms and languages.
Avrim Blum	Machine learning, approximation and on-line algorithms, AI planning.
Manuel Blum	Complexity Theory, cryptography, program checking.
Thomas A. Bohman	Extremal Combinatorics.
Gerard Cornuéjols	Combinatorial optimization, graph theory, integer programming.
Alan Frieze	Average case analysis of algorithms, combinatorics.
Irina Gheorghiciuc	Combinatorics.
Anupam Gupta	Approximation algorithms, metric embeddings, network algorithms.
Venkatesan Guruswami	Coding theory, Approximation Algorithms and Hardness of Approximations, Complexity Theory.
Mor Harchol-Balter	Queueing theory, stochastic modeling, probability theory, heavy-tailed workloads, Web servers, networking.
John Hooker	Operations research techniques in logic, artificial intelligence.
John Lafferty	Speech and natural language processing, statistical learning algorithms, information theory.
Po-Shen Loh	Probabilistic and Extremal Combinatorics, and applications to Theoretical Computer Science.
Bruce Maggs	Parallel algorithms and architectures, computer networks.
François Margot	Integer Linear Programming, Polyhedral Combinatorics, Enumeration Problems.
Gary Miller	Algorithm design, parallel algorithms, scientific computing.
Ryan O'Donnell	Complexity theory, analysis of boolean functions, approximation hardness.
Javier Pena	Theory and algorithms for convex optimization, numerical analysis.
Oleg Pikhurko	Extremal graph theory and Ramsey theory.
R. Ravi	Approximation algorithms, combinatorial optimization, computational biology.
Steven Rudich	Complexity theory, cryptography, combinatorics.
Daniel Sleator	Data structures, algorithms, parsing.
Richard Statman	Theory of computation, symbolic computation.
Michael Trick	Computational integer and combinatorial optimization, applications in sports and the social sciences.
Willem Van Hoeve	Combinatorial optimization; constraint programming; mathematical programming; integration of constraint programming and mathematical programming.

Key: Computer Science Department Tepper School of Business Department of Mathematical Sciences

Students

Amitabh Basu with Gerard Cornuejols	Integer Programming, Metric Embeddings, Computational Geometry
Deepak Bal
Patrick Bennett
David Bergman
Xi Chen
Lisa Espig
Samid Hoda
Nate Ince
Brian Kell
Misha Lavrov
Qihang Lin
Marco Molinaro
Viswanath Nagarajan with R. Ravi	Approximation algorithms, Combinatorial Optimization, Routing and Scheduling.
Afshin Nikzad
Andrea Qualizza with Egon Balas	Integer Programming, Combinatorial Optimization.
Amin Sayedi with R. Ravi	Algorithmic Game Theory and Mechanism Design, Approximation Algorithms, Combinatorics and Graph Theory
Marla Slusky
Charalampos (Babis) Tsourakakis with Alan Frieze	Probability on graphs, randomized algorithms, spectral graph theory and machine learning
Christopher Wallace with Egon Balas	Algebra, Algorithms and Complexity, Combinatorics, Graph theory, Number theory.
Zelealem Yilma with Oleg Pikhurkho	Extremal Graph Theory

Key: CS TSB Math

Recent Graduates

Related Web Sites

ACO Seminars Home Page

CS Theory Lunch Home Page

Operations Research Group

Neil Simonetti's Travelling Salesman Problem Page

Michael Trick's Operation Research Home Page

Michael Trick's Operation Research Blog

Dennis Grinsburg's Theory Home Page

Bennet Yee's Computer Security Home Page

Advice on Research and Writing

General questions or suggestions, please contact: Alan Frieze or Avrim Blum