Algorithms and Complexity

The field of algorithms and complexity is concerned with the development, analysis, and evaluation of algorithms and data structures that enable efficient computation and problem-solving, as well as the study of the inherent complexity of computational problems and the design of algorithms that can handle such problems efficiently. Some of the topics faculty and students in these areas explore include the following:

  • Algorithm design and analysis
  • Cache-Efficient Algorithms
  • Computational complexity theory
  • Parallel Algorithms
  • Parallel and external-memory algorithms
  • String algorithms