Marek Karpinski
From Wikipedia, the free encyclopedia
Marek Karpinski is a computer scientist and mathematician known for his research in the theory of algorithms and their applications, combinatorial optimization, computational complexity, and mathematical foundations. He is a recipient of several research prizes in the above areas.
He is currently a Professor of Computer Science, and the Head of the Algorithms Group at the University of Bonn. He is also a member of Bonn International Graduate School in Mathematics BIGS-MPA and the Hausdorff Research Institute for Mathematics.
[edit] References
- Karpinski's homepage with list of publications
- Computer Science Bibliographies
- Oberwolfach Photo Collection
- Fundamentals of Computation Theory, Steering Committee
- Marek Karpinski at the Mathematics Genealogy Project
[edit] See also
- Computational complexity theory
- NP-complete
- Approximation algorithms
- List of computer scientists
- List of mathematicians
