Jump to content

Marek Karpinski

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Jevansen (talk | contribs) at 06:24, 6 May 2024 (Moving from Category:Theoretical computer scientists to Category:American theoretical computer scientists using Cat-a-lot). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Marek Karpinski in Oberwolfach, 2007

Marek Karpinski[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]
  1. ^ Marek Karpinski Biography at the Hausdorff Center for Mathematics, Excellence Cluster
Retrieved from "https://en.wikipedia.org/w/index.php?title=Marek_Karpinski&oldid=1222484947"