Sven Reichard
Sven Reichard,
a German mathematician, and researcher and lecturer at TU Dresden, and before research associate at University of Western Australia, Perth [2].
He holds a Ph.D. in mathematics from University of Delaware, Newark under advisor Mikhail H. Klin [3].
His research focuses on discrete mathematics, graph theory, finite geometry and computational discrete algebra.
He is co-author of the finite geometry package FinInG [4] [5], written in the GAP framework [6],
which also provides an interpreted programming language. Interested in computer chess programming, Sven Reichard has written the experimental Chess Engine Communication Protocol compatible chess engine Alice [7] [8] (written in GAP? No C++ [9]).
Further, Sven Reichard is author of the Pool program Snooze, which participated at the 11th Computer Olympiad 2006 in Turin.
Contents
Selected Publications
2000 ...
- Sven Reichard (2000). A Criterion for the t-Vertex Condition of Graphs. Journal of Combinatorial Theory Series A
- Sven Reichard (2003). Computational and Theoretical Analysis of Coherent Configurations and Related Incidence Structure. Ph.D. thesis, University of Delaware
2005 ...
- Sven Reichard (2005). The smallest non-rank 3 graphs with the 4-vertex condition. Greifswald, Germany
- Christian Pech, Sven Reichard (2009). Enumerating Set Orbits. Algorithmic Algebraic Combinatorics and Gröbner Bases, Part 1, Springer [12]
- Maska Law, Cheryl E. Praeger, Sven Reichard (2009). Flag-transitive symmetric 2-(96, 20, 4)-designs. Journal of Combinatorial Theory Series A, School of Mathematics and Statistics, University of Western Australia
2010 ...
- Mikhail H. Klin, Christian Pech, Sven Reichard, Andrew Woldar, Matan Ziv-Av (2010). Examples of computer experimentation in algebraic combinatorics. Ars Mathematica Contemporanea, Vol. 3, No. 2
- Mikhail H. Klin, Sven Reichard (2013). Construction of small strongly regular designs. Trudy Instituta Matematiki i Mekhaniki UrO RAN, Vol. 19, No. 3
Forum Posts
1999
- Re: How do you represent chess boards in your chess programms by Sven Reichard, CCC, September 29, 1999
2000 ...
- A mate for Leonid by Sven Reichard, CCC, October 10, 2001 » Leonid's Positions
- Re: About random numbers and hashing by Sven Reichard, CCC, December 05, 2001
- Re: Low weight random matricies by Sven Reichard, GAP Forum, March 21, 2002
- Gestatten: Alice by Sven Reichard, CCC, June 23, 2002
- Re: Something new about Fritz? English by Sven Reichard, CCC, June 23, 2002
- Re: Something new about Fritz? English, part 2 by Sven Reichard, CCC, June 24, 2002 » Eduard Nemeth, Fritz
- First draw against GnuChess by Sven Reichard, CCC, November 26, 2003
2005 ...
- Re: question by Sven Reichard, GAP Forum, January 30, 2008
External Links
References
- ↑ TUD - Sven Reichard's Homepage (as of November 28, 2018, no longer available)
- ↑ CMSA Inc. E-Newsletter 23, February 2007
- ↑ Sven Reichard (2003). Computational and Theoretical Analysis of Coherent Configurations and Related Incidence Structure. Ph.D. thesis, University of Delaware
- ↑ FinInG - a finite geometry package for GAP, Ghent University
- ↑ GAP - Groups, Algorithms and Programming, Ghent University
- ↑ GAP System for Computational Discrete Algebra
- ↑ First draw against GnuChess by Sven Reichard, CCC, November 26, 2003
- ↑ Re: Alice by Dann Corbit, Winboard Forum, March 18, 2005
- ↑ Gestatten: Alice by Sven Reichard, CCC, June 23, 2002
- ↑ dblp: Sven Reichard
- ↑ Publications - A.J. Woldar, co-autor: Sven Reichard
- ↑ Gröbner basis from Wikipedia