25,161
edits
Changes
Created page with "'''Home * People * Burkhard Monien''' FILE:BurkhardMonien.jpg|border|right|thumb|link=https://www.uni-paderborn.de/nachricht/11901/| Burkhard Monien <ref..."
'''[[Main Page|Home]] * [[People]] * Burkhard Monien'''
[[FILE:BurkhardMonien.jpg|border|right|thumb|link=https://www.uni-paderborn.de/nachricht/11901/| Burkhard Monien <ref>[https://www.uni-paderborn.de/nachricht/11901/ 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)</ref> ]]
'''Burkhard Monien''',<br/>
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 Search|parallel distributed search]], as well in hosting the International Paderborn Computer Chess Championship [[IPCCC]] and the [[WCCC 1999|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 (Program)|Zugzwang]], [[Ulysses]], [[Cheiron]] and [[P.ConNerS]].
=Photos=
[[FILE:Monien2.jpg|none|border|text-bottom|link=http://alumni.cs.uni-dortmund.de/content/burkhard-monien]]
Burkhard Monien, 1977 at [[University of Dortmund]] <ref>[http://alumni.cs.uni-dortmund.de/content/burkhard-monien Burkhard Monien | Alumni der Informatik Dortmund e.V. (1977)], Photo by [[Oliver Vornberger]], [http://alumni.cs.uni-dortmund.de/image Bildgalerien | Alumni der Informatik Dortmund e.V.]</ref>
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/m/Monien:Burkhard dblp: Burkhard Monien]</ref>
==1969==
* [[Burkhard Monien]] ('''1969'''). ''Entwicklungssätze bei Operatorenbüscheln''. Dissertation, [[University of Hamburg]], advisor [[Mathematician#Collatz|Lothar Collatz]]
==1970 ...==
* [[Burkhard Monien]], [[Ewald Speckenmeyer]] ('''1979'''). ''3-Satisfiability is Testable in O(1,62)''. [[University of Paderborn|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''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]] <ref>[[Jonathan Schaeffer]] ('''1989'''). ''Comment on Distributed Game-Tree Search''. [[ICGA Journal#12_4|ICCA Journal, Vol. 12, No. 4]]</ref>
==1990 ...==
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1990'''). ''Response to a Comment on Distributed Game-Tree Search''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]] <ref>[[Jonathan Schaeffer]] ('''1990'''). ''A Rejoinder to the Response to a Comment on Distributed Game-Tree Search''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]]</ref>
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], [http://www.top-5000.nl/ps/A%20fully%20distribuited%20chess%20program.pdf pdf]
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1992'''). ''Experiments with a Fully Distributed Chess Program''. [[3rd Computer Olympiad#Workshop|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''. [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/FM_T3E.ps.Z ps] <ref>[https://www.computerwoche.de/a/forschungszentrum-juelich-schickt-cray-t-3-zur-schachweltmeisterschaft,508177 Forschungszentrum Jülich schickt Cray T-3 zur Schachweltmeisterschaft], June 09, 1999, [[Computerworld#Woche|Computerwoche]] (German) » [[WCCC 1999]]</ref>
* [[Burkhard Monien]], [[Rainer Feldmann]], [[Jaap van den Herik]] ('''1999'''). ''More Information on the 9th World Computer-Chess Championship''. [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://arno.uvt.nl/show.cgi?fid=107328 pdf] » [[WCCC 1999]]
==2000 ...==
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Stefan Schamberger]] ('''2000'''). ''A Distributed Algorithm to Evaluate Quantified Boolean Formulae''. AAAI-00 Proceedings, [http://www.aaai.org/Papers/AAAI/2000/AAAI00-044.pdf pdf]
* [[Jaap van den Herik]], [[Burkhard Monien]] (eds.) ('''2001'''). ''[[Advances in Computer Games 9]]''. Computer Science Department, [[Maastricht University|Universiteit Maastricht]], ISBN 9062165664
* [[Ulf Lorenz]], [[Burkhard Monien]] ('''2002'''). ''[http://www.springerlink.com/content/f6b4wb6l63dpd0jv/ The Secret of Selective Game Tree Search, When Using Random-Error Evaluations]''. Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), [http://www.top-5000.nl/ps/The%20secret%20of%20selective%20earch%20when%20using%20random.pdf 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, [http://www2.cs.uni-paderborn.de/cs/ag-monien/PERSONAL/CHESSY/pdf/quartic.pdf pdf 2009]
* [https://dblp.uni-trier.de/pers/hd/d/Dumrauf:Dominic Dominic Dumrauf], [[Burkhard Monien]] ('''2012'''). ''Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete''. [https://en.wikipedia.org/wiki/Parallel_Processing_Letters Parallel Processing Letters], Vol. 22, No. 4
=External Links=
* [http://wwwcs.uni-paderborn.de/cs/bm/ Prof. Dr. rer. nat. Burkhard Monien]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=49865 The Mathematics Genealogy Project - Burkhard Monien]
* [http://de.wikipedia.org/wiki/Burkhard_Monien Burkhard Monien - Wikipedia.de] (German)
* [https://www.uni-paderborn.de/nachricht/11901/ 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)
* [https://www.uni-paderborn.de/nachricht/27411/ 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=
<references />
'''[[People|Up one level]]'''
[[FILE:BurkhardMonien.jpg|border|right|thumb|link=https://www.uni-paderborn.de/nachricht/11901/| Burkhard Monien <ref>[https://www.uni-paderborn.de/nachricht/11901/ 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)</ref> ]]
'''Burkhard Monien''',<br/>
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 Search|parallel distributed search]], as well in hosting the International Paderborn Computer Chess Championship [[IPCCC]] and the [[WCCC 1999|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 (Program)|Zugzwang]], [[Ulysses]], [[Cheiron]] and [[P.ConNerS]].
=Photos=
[[FILE:Monien2.jpg|none|border|text-bottom|link=http://alumni.cs.uni-dortmund.de/content/burkhard-monien]]
Burkhard Monien, 1977 at [[University of Dortmund]] <ref>[http://alumni.cs.uni-dortmund.de/content/burkhard-monien Burkhard Monien | Alumni der Informatik Dortmund e.V. (1977)], Photo by [[Oliver Vornberger]], [http://alumni.cs.uni-dortmund.de/image Bildgalerien | Alumni der Informatik Dortmund e.V.]</ref>
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/m/Monien:Burkhard dblp: Burkhard Monien]</ref>
==1969==
* [[Burkhard Monien]] ('''1969'''). ''Entwicklungssätze bei Operatorenbüscheln''. Dissertation, [[University of Hamburg]], advisor [[Mathematician#Collatz|Lothar Collatz]]
==1970 ...==
* [[Burkhard Monien]], [[Ewald Speckenmeyer]] ('''1979'''). ''3-Satisfiability is Testable in O(1,62)''. [[University of Paderborn|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''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]] <ref>[[Jonathan Schaeffer]] ('''1989'''). ''Comment on Distributed Game-Tree Search''. [[ICGA Journal#12_4|ICCA Journal, Vol. 12, No. 4]]</ref>
==1990 ...==
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1990'''). ''Response to a Comment on Distributed Game-Tree Search''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]] <ref>[[Jonathan Schaeffer]] ('''1990'''). ''A Rejoinder to the Response to a Comment on Distributed Game-Tree Search''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]]</ref>
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], [http://www.top-5000.nl/ps/A%20fully%20distribuited%20chess%20program.pdf pdf]
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1992'''). ''Experiments with a Fully Distributed Chess Program''. [[3rd Computer Olympiad#Workshop|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''. [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/FM_T3E.ps.Z ps] <ref>[https://www.computerwoche.de/a/forschungszentrum-juelich-schickt-cray-t-3-zur-schachweltmeisterschaft,508177 Forschungszentrum Jülich schickt Cray T-3 zur Schachweltmeisterschaft], June 09, 1999, [[Computerworld#Woche|Computerwoche]] (German) » [[WCCC 1999]]</ref>
* [[Burkhard Monien]], [[Rainer Feldmann]], [[Jaap van den Herik]] ('''1999'''). ''More Information on the 9th World Computer-Chess Championship''. [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://arno.uvt.nl/show.cgi?fid=107328 pdf] » [[WCCC 1999]]
==2000 ...==
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Stefan Schamberger]] ('''2000'''). ''A Distributed Algorithm to Evaluate Quantified Boolean Formulae''. AAAI-00 Proceedings, [http://www.aaai.org/Papers/AAAI/2000/AAAI00-044.pdf pdf]
* [[Jaap van den Herik]], [[Burkhard Monien]] (eds.) ('''2001'''). ''[[Advances in Computer Games 9]]''. Computer Science Department, [[Maastricht University|Universiteit Maastricht]], ISBN 9062165664
* [[Ulf Lorenz]], [[Burkhard Monien]] ('''2002'''). ''[http://www.springerlink.com/content/f6b4wb6l63dpd0jv/ The Secret of Selective Game Tree Search, When Using Random-Error Evaluations]''. Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), [http://www.top-5000.nl/ps/The%20secret%20of%20selective%20earch%20when%20using%20random.pdf 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, [http://www2.cs.uni-paderborn.de/cs/ag-monien/PERSONAL/CHESSY/pdf/quartic.pdf pdf 2009]
* [https://dblp.uni-trier.de/pers/hd/d/Dumrauf:Dominic Dominic Dumrauf], [[Burkhard Monien]] ('''2012'''). ''Computing Nash Equilibria for Two-Player Restricted Network Congestion Games is -Complete''. [https://en.wikipedia.org/wiki/Parallel_Processing_Letters Parallel Processing Letters], Vol. 22, No. 4
=External Links=
* [http://wwwcs.uni-paderborn.de/cs/bm/ Prof. Dr. rer. nat. Burkhard Monien]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=49865 The Mathematics Genealogy Project - Burkhard Monien]
* [http://de.wikipedia.org/wiki/Burkhard_Monien Burkhard Monien - Wikipedia.de] (German)
* [https://www.uni-paderborn.de/nachricht/11901/ 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)
* [https://www.uni-paderborn.de/nachricht/27411/ 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=
<references />
'''[[People|Up one level]]'''
