Burkhard Monien,
a German computer scientist, professor, since 2008 professor Emeritus, and researcher in parallel computing at the University of Paderborn. He is Head of the research group AG Monien: Efficient Use of Parallel and Distributed Systems [1].
Burkhard Monien, Oliver Vornberger (1988). Parallel Alpha-Beta versus Parallel SSS*. Proc. of the IFIP WG 10.3 Working Conference on Distributed Processing, North Holland
Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1992). Distributed Game Tree Search on a Massively Parallel System. Data Structures and Efficient Algorithms, B. Monien, Th. Ottmann (eds.), Springer, Lecture Notes in Computer Science, 594
Burkhard Monien, Tobias Tscheuschner (2010). On the power of nodes of degree four in the local max-cut problem. CIAC'10, Rome, early version was published as a technical report in 2009, pdf 2009
a German computer scientist, professor, since 2008 professor Emeritus, and researcher in parallel computing at the University of Paderborn. He is Head of the research group AG Monien: Efficient Use of Parallel and Distributed Systems [1].
Burkhard Monien is supporter of computer chess and games - in inspiring his students on the research topic of parallel distributed search, as well in hosting the International Paderborn Computer Chess Championship IPCCC and the 9.th World Computer Chess Championship in 1999. His former students Rainer Feldmann, Peter Mysliwietz, Ulf Lorenz and Valentin Rottmann were authors of the parallel chess programs Zugzwang, Ulysses, Cheiron and P.ConNerS.
Table of Contents
Photos
Selected Publications
[4] [5] [6]1969
1970 ...
1980 ...
1990 ...
2000 ...
2010 ...
External Links
AG-Monien - Research - Game Trees
References
What links here?
Up one level