Algorithms and Complexity

The following faculty have either an interest or a background in this area. Please visit the individual faculty member's web site for the most up to date summary of their research.

Donald Chinn

»Algorithms and algorithm complexity.

Peter Horak

»Discrete mathematics.
»Graph theory and combinatorics.
»Theoretical computer science.

George Mobus

»Real-time, online, lifetime learning algorithms.

Moshe Rosenfeld

»Design and analysis of algorithms.

top