|
|
|
TU München
The chair for efficient algorithms of the Computer Science Department of
the Technical University of Munich was founded in spring 1993 and employs
about 20 persons. The research at this chair includes the development of
efficient algorithms for combinatorial or graph-theoretically problems. A
further important field is the complexity analysis of problems and procedures.
It contains the determination of upper bounds, i.e., the estimation of the
resources needed by well-known or newly developed algorithms and the derivation
of lower bounds.
In particular, the chair's research focus is on algorithmic aspects of the
following areas:
- Graph theory
- Randomized algorithms and probabilistic methods
- Computer algebra
- Petri Nets
- Scheduling
- Bioinformatics
- Complexity theory
- Algorithm visualisation/animation
- Bibliographic databases
- Internet algorithms
- Network analysis
|
|
|
|
