[ University of Bonn | CS Department | Chair V | deutsche Version ]

Algorithms (Prof. M. Karpinski)

Randomized and Approximate Algorithms:

In this area Professor Karpinski is occupied with fundamental questions of design of approximate algorithms, organization of parallel and distributed systems as well as the resulting problems of network communication.

Professor Karpinski is also interested in fundamental questions of randomization as computational resource. For some important computational problems, it appears now that the randomized or pseudo-randomized algorithms are more efficient than the deterministic ones in terms of running time, hardware size, circuit depths, etc.. Recently essential progresses have been made, e.g. the design of efficient approximate algorithms for various combinatorial and algebraic enumeration and optimization problems. Solutions to these problems have applications ranging from the algorithms, circuit design and coding theory to statistic mechanic und quantum theory.

In particular the research topics include:

• Design of efficient algorithms
• Computational complexity
• Randomized and approximate algorithms
• Parallel and distributed computer architectures
• Circuit Theory
• VLSI-Design and Algorithms
• Internet Algorithms
  
• Combinatorial Optimization
• Efficient approximation algorithms
• Computational Molecular Biology
  
• Algorithmic learning theory

Note: Please report any problems with our server by Email to: webmaster@theory.cs.uni-bonn.de

Last modified: August 25th 2003

[ University of Bonn | CS Department | Chair V | deutsche Version ]