Difference between revisions of "Burkhard Monien"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 13: | Line 13: | ||
=Selected Publications= | =Selected Publications= | ||
| − | <ref>[ | + | <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/m/Monien:Burkhard dblp: Burkhard Monien]</ref> |
==1969== | ==1969== | ||
* [[Burkhard Monien]] ('''1969'''). ''Entwicklungssätze bei Operatorenbüscheln''. Dissertation, [[University of Hamburg]], advisor [[Mathematician#Collatz|Lothar Collatz]] | * [[Burkhard Monien]] ('''1969'''). ''Entwicklungssätze bei Operatorenbüscheln''. Dissertation, [[University of Hamburg]], advisor [[Mathematician#Collatz|Lothar Collatz]] | ||
Latest revision as of 17:27, 16 November 2020
Home * People * Burkhard Monien
Burkhard Monien [1]
Burkhard Monien,
a German computer scientist, professor, since 2008 professor emeritus, and researcher in parallel computing at the Paderborn University, and head of the research group AG Monien: Efficient Use of Parallel and Distributed Systems.
Burkhard Monien supported 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.
Contents
Photos
Burkhard Monien, 1977 at University of Dortmund [2]
Selected Publications
1969
- Burkhard Monien (1969). Entwicklungssätze bei Operatorenbüscheln. Dissertation, University of Hamburg, advisor Lothar Collatz
1970 ...
- Burkhard Monien, Ewald Speckenmeyer (1979). 3-Satisfiability is Testable in O(1,62). Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 3
1980 ...
- Burkhard Monien, Ewald Speckenmeyer (1985). Solving Satisfiability in Less than 2n. North-Holland Publishing Company, Discrete Appl. Math., Vol. 10, No. 3, 287-295
- Oliver Vornberger, Burkhard Monien, Ewald Speckenmeyer (1986). Superlinear Speedup for Parallel Backtracking. Technical Report 30, Paderborn University
- 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, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger (1989). Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 2 [5]
1990 ...
- Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger (1990). Response to a Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 13, No. 1 [6]
- Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1991). A Fully Distributed Chess Program. Advances in Computer Chess 6, pdf
- Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1992). Experiments with a Fully Distributed Chess Program. Heuristic Programming in AI 3
- 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
- Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1994). Game-Tree Search on a Massively Parallel System. Advances in Computer Chess 7
- Rainer Feldmann, Burkhard Monien (1998). Selective Game Tree Search on a Cray T3E. ps [7]
- Burkhard Monien, Rainer Feldmann, Jaap van den Herik (1999). More Information on the 9th World Computer-Chess Championship. ICCA Journal, Vol. 22, No. 1, pdf » WCCC 1999
2000 ...
- Rainer Feldmann, Burkhard Monien, Stefan Schamberger (2000). A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI-00 Proceedings, pdf
- Jaap van den Herik, Burkhard Monien (eds.) (2001). Advances in Computer Games 9. Computer Science Department, Universiteit Maastricht, ISBN 9062165664
- Ulf Lorenz, Burkhard Monien (2002). The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pdf
2010 ...
- 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
- Dominic Dumrauf, Burkhard Monien (2012). Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete. Parallel Processing Letters, Vol. 22, No. 4
External Links
- Prof. Dr. rer. nat. Burkhard Monien
- The Mathematics Genealogy Project - Burkhard Monien
- Burkhard Monien - Wikipedia.de (German)
- Universität Paderborn ehrt mit Festkolloquium Prof. Dr. Burkhard Monien – 1977 als erster Informatiker berufen – Gastredner Prof. Papadimitriou von der University of California, Berkeley, April 25, 2008 (German)
- Prof. Dr. Burkhard Monien für seine großen Verdienste in der Informatik zum „Fellow“ der Gesellschaft für Informatik ernannt – National und international anerkannter Experte, October 04, 2010 (German)
References
- ↑ Universität Paderborn ehrt mit Festkolloquium Prof. Dr. Burkhard Monien – 1977 als erster Informatiker berufen – Gastredner Prof. Papadimitriou von der University of California, Berkeley, April 25, 2008 (German)
- ↑ Burkhard Monien | Alumni der Informatik Dortmund e.V. (1977), Photo by Oliver Vornberger, Bildgalerien | Alumni der Informatik Dortmund e.V.
- ↑ ICGA Reference Database
- ↑ dblp: Burkhard Monien
- ↑ Jonathan Schaeffer (1989). Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 4
- ↑ Jonathan Schaeffer (1990). A Rejoinder to the Response to a Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 13, No. 1
- ↑ Forschungszentrum Jülich schickt Cray T-3 zur Schachweltmeisterschaft, June 09, 1999, Computerwoche (German) » WCCC 1999
