Marek Karpinski
From Wikipedia, the free encyclopedia
Marek Karpinski (born 25 March 1948)[1] 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 and the Hausdorff Center for Mathematics.
See also[edit]
References[edit]
- ^ Marek Karpinski at the Hausdorff Center for Mathematics
- Karpinski's homepage with list of publications
- Computer Science Bibliographies
- Oberwolfach Photo Collection
- Fundamentals of Computation Theory, Steering Committee
- Bonn Workshop on Foundations of Computing (BFC '87)
- Max Planck Research Awards 1994
- Bonn Workshop on Randomized Algorithms (RAND)
- Marek Karpinski at the Mathematics Genealogy Project
- Travelling salesman problem
External links[edit]
- Marek Karpinski at DBLP
- Marek Karpinski at Google Scholar Citations
- Marek Karpinski at MathSciNet
- A compendium of NP optimization problems
- Publications at ICSI, Berkeley
- Publications at EECS, UC Berkeley
- Publications at Princeton Computer Science
- Seminars, Dagstuhl Schloss, Dagstuhl
- Research CS Reports, University of Bonn
- Karpinski's Books
- The Best Nurturers in Computer Science Research
- Publications at ACM Digital Library
| This biographical article about a scientist is a stub. You can help Wikipedia by expanding it. |