Prof. Monien has been working for more than 20 years on the theory of parallel computing and its applications in practical and applied computer science. Many important problems have been studied theoretically and, based on the results obtained, efficient architectures and algorithms have been implemented. There was a focus on the design on interconnection networks and on the problems on balancing the work load in large parallel systems and on partitioning large logical networks. For several application problems, efficient codes have been implemented.
Since the beginning of the new millennium, Prof. Monien has switched his main focus to a new research field in theoretical computer science. The seminal papers of Koutsopias/Papadimitriou and Nisan/Ronen opened the field of algorithmic game theory, which emerged into a very attractive new research field. An important new notion is the price of anarchy describing the loss of efficiency due to allowing agents to operate selfishly. Prof. Monien is one of the leading european researchers in algorithmic game theory. He studied the behavior of selfish agents (existence of pure Nash equilibria, complexity of determining Nash equilibria, prize of anarchy) and certain cost-sharing questions related to resource allocation problems.
Prof. B.
Monien, born in 1943, obtained his PhD at the University of Hamburg in 1969.
After working at the institutes for applied mathematics and for computer
science at the University of Hamburg, he was appointed Associate Professor at
the Department of Computer Science of the University of Dortmund in 1975. Since
1977 he is Professor at the University of Paderborn.
His research
interests include
theoretical questions (design of efficient algorithms, algorithmic game theory,
theory of interconnection networks, complexity theory, etc.) and practical
problems concerning the efficient use of parallel systems (mapping, load
balancing, parallel implementations of algorithms, architectures of parallel
systems, etc.). His recent research focusses on algorithmic game theory.
He has published more than 200
papers in most of the well-known computer
science conferences and journals.
Prof. B. Monien has worked in numerous program comittees and he has been a
chairman of the program committees of STACS'89, ICALP'91, ICALP'96,
Euro-Par'02, IPDPS'04, SAGT/08. He has served as chairman of the computer
science departments in Dortmund and in Paderborn, as the vice president of the
University of Paderborn and as chairman of the section ``Foundations of
Computer Science'' of the German ``Gesellschaft
für Informatik''.
Until July 1997, he was the secretary of the European Association for
Theoretical Computer Science (EATCS).
He is member of the council of the
Heinz Nixdorf Institute and of the Paderborn Center for Parallel Computing.
In 1992, Prof. B. Monien won the Leibniz
research award of
the DFG together with Prof. Dr. F. Meyer auf der Heide also from the University of Paderborn.
In 1996 he became a member of the "Nordrhein-Westfälische Akademie der
Wissenschaften und der Künste".
In 1997 he was a founding member of the “Konvent für Technikwissenschaften”
which operates since 2008 as “acatech– Deutsche Akademie der
Technikwissenschaften”.
From 2007 until 2009 he was appointed Sekretar
(chairman) of the class “Ingenieur- und Wirtschaftswissenschaften” of the
“Nordrhein-Westfälische Akademie der Wissenschaften”.
From 2009 until 2012 he acted as President of the European Association for Theoretical
Computer Science (EATCS) and from 2012 until 2014 as Vice-president.
In 2010 he was appointed by the "German Gesellschaft für Informatik e.V. (GI)" for his great achievements in computer science as GI-Fellow.
Prof. Dr. Burkhard Monien
Universität Paderborn
Institut für Informatik
Fürstenallee 11
33102 Paderborn
Deutschland
Office: F2.413
Phone: +49-5251-60-6707
Email: bm[at]uni-paderborn.de
Marion Hucke
Office: F2.411
Phone: +49-5251-60-6695
Fax: +49-5251-60-6697
Email: marion.hucke[at]uni-paderborn.de