Home * People * Bernhard Balkenhol

		Bernhard Balkenhol, a German mathematician, computer scientist, associate and CEO at infinity³ GmbH ^[1], and visiting lecturer at University of Bielefeld ^[2], where he already received his Diplom in 1992, and Ph.D. degree in 1995 under supervision of Rudolf Ahlswede and Ingo Althöfer. His research interests include search algorithms and data compression. In particular, based on Jürg Nievergelt's idea of asking a sequence of yes-no-questions ^[3], Balkenhol elaborated on compression in encoding typical chess positions with less than 136 bits, as published in the ICCA Journal ^[4].
Bernhard Balkenhol ^[5]

Selected Publications

^[6] ^[7]

Bernhard Balkenhol (1992). k-reguläre Minimax-Bäume mit distinkten Blattwerten, die unabhängig von ihrer Sortierung leicht für den Alpha-Beta-Algorithmus sind. Diplom thesis, Bielefeld University, zipped ps (German)
Ingo Althöfer, Bernhard Balkenhol (1992). A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Algorithm. Artificial Intelligence Vol. 52, No. 2
Bernhard Balkenhol (1994). Data Compression in Encoding Chess Positions. ICCA Journal, Vol. 17, No. 3, zipped ps
Bernhard Balkenhol (1995). Datenkompression mit deterministischen Experten und Systeme teilweise unabhängiger Zufallsvariablen. Ph.D. thesis, Bielefeld University, advisor Rudolf Ahlswede and Ingo Althöfer (German)
Bernhard Balkenhol (1996). Problems in Sequential and Parallel Game Tree Search. Bielefeld University, zipped ps
Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai (2002). Parallel Error Correcting Codes. IEEE Transactions on Information Theory, Vol. 48, No. 4
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich (2006). A Fast Suffix-Sorting Algorithm. GTIT-C 2006

External Links

Up one level