25,161
edits
Changes
Created page with "'''Home * People * Bernhard Balkenhol''' FILE:bernhard-Balkenhol-2.jpg|border|right|thumb|link=http://www.balkenhol.net/| Bernhard Balkenhol <ref>[http://..."
'''[[Main Page|Home]] * [[People]] * Bernhard Balkenhol'''
[[FILE:bernhard-Balkenhol-2.jpg|border|right|thumb|link=http://www.balkenhol.net/| Bernhard Balkenhol <ref>[http://www.balkenhol.net/ Dr. Bernhard Balkenhol - Homepage]</ref> ]]
'''Bernhard Balkenhol''',<br/>
a German mathematician, computer scientist and authorized officer and CEO in the [https://en.wikipedia.org/wiki/Information_technology IT] indutry <ref>[https://www.linkedin.com/in/bernhard-balkenhol-29a22ba/ Bernhard Balkenhol | LinkedIn]</ref>. Until 2014, he served as visiting lecturer at [https://en.wikipedia.org/wiki/University_of_Bielefeld University of Bielefeld], where he already received a [https://en.wikipedia.org/wiki/Diplom diplom] in 1992, and a Ph.D. degree in 1995 under supervision of [[Mathematician#Ahlswede|Rudolf Ahlswede]] and [[Ingo Althöfer]].
His research interests include [[Search|search algorithms]] and [https://en.wikipedia.org/wiki/Data_compression data compression]. Based on [[Jürg Nievergelt|Jürg Nievergelt's]] idea of asking a sequence of [https://en.wikipedia.org/wiki/Yes%E2%80%93no_question yes-no-questions] <ref>[[Jürg Nievergelt]] ('''1977'''). ''[[Workshop Chess and Mathematics#Information|Information content of chess positions]].'' [[ACM#SIG|ACM SIGART Newsletter]], Vol. 62</ref>, Balkenhol elaborated on compression in encoding typical [[Chess Position|chess positions]] with less than 136 bits, as published in the [[ICGA Journal#17_3|ICCA Journal]] <ref>[[Bernhard Balkenhol]] ('''1994'''). ''Data Compression in Encoding Chess Positions.'' [[ICGA Journal#17_3|ICCA Journal, Vol. 17, No. 3]], [http://www.balkenhol.net/papers/icca94.ps.gz zipped ps]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Balkenhol:Bernhard.html dblp: Bernhard Balkenhol]</ref> <ref>[http://www.balkenhol.net/balkenhol.html Dr. Bernhard Balkenhol - Publications]</ref>
==1990 ...==
* [[Ingo Althöfer]], [[Bernhard Balkenhol]] ('''1991'''). ''[https://www.sciencedirect.com/science/article/abs/pii/000437029190042I#! A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Algorithm]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence] Vol. 52, No. 2
* [[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, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], [http://www.balkenhol.net/papers/diplom.ps.gz zipped ps] (German)
* [[Bernhard Balkenhol]] ('''1994'''). ''Data Compression in Encoding Chess Positions.'' [[ICGA Journal#17_3|ICCA Journal, Vol. 17, No. 3]], [http://www.balkenhol.net/papers/icca94.ps.gz zipped ps]
* [[Bernhard Balkenhol]] ('''1995'''). ''[https://pub.uni-bielefeld.de/publication/2437381 Datenkompression mit deterministischen Experten und Systeme teilweise unabhängiger Zufallsvariablen]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], advisor [[Mathematician#Ahlswede|Rudolf Ahlswede]] and [[Ingo Althöfer]] (German)
* [[Bernhard Balkenhol]] ('''1996'''). ''Problems in Sequential and Parallel Game Tree Search''. [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], [http://www.mathematik.uni-bielefeld.de/sfb343/preprints/pre97001.ps.gz zipped ps]
==2000 ...==
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/c/Cai:Ning.html Ning Cai] ('''2002'''). ''Parallel Error Correcting Codes''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 48, No. 4
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/d/Deppe:Christian.html Christian Deppe], [https://dblp.uni-trier.de/pers/hd/f/Fr=ouml=hlich:Martin.html Martin Fröhlich] ('''2006'''). ''A Fast Suffix-Sorting Algorithm''. [https://dblp.uni-trier.de/db/conf/gtitc/gtitc2006.html GTIT-C 2006]
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/k/Kleinew=auml=chter:Christian Christian Kleinewächter] ('''2006'''). ''Identification for Sources''. [https://dblp.uni-trier.de/db/conf/gtitc/gtitc2006.html GTIT-C 2006]
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/d/Deppe:Christian.html Christian Deppe], [https://dblp.uni-trier.de/pers/hd/m/Mashurian:Haik Haik Mashurian], [https://dblp.uni-trier.de/pers/hd/p/Partner:T= T. Partner] ('''2008'''). ''T-shift synchronization codes''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 156, No. 9
=External Links=
* [http://www.balkenhol.net/ Dr. Bernhard Balkenhol - Homepage]
* [https://www.linkedin.com/in/bernhard-balkenhol-29a22ba/ Bernhard Balkenhol | LinkedIn]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=57925 The Mathematics Genealogy Project - Bernhard Balkenhol]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:bernhard-Balkenhol-2.jpg|border|right|thumb|link=http://www.balkenhol.net/| Bernhard Balkenhol <ref>[http://www.balkenhol.net/ Dr. Bernhard Balkenhol - Homepage]</ref> ]]
'''Bernhard Balkenhol''',<br/>
a German mathematician, computer scientist and authorized officer and CEO in the [https://en.wikipedia.org/wiki/Information_technology IT] indutry <ref>[https://www.linkedin.com/in/bernhard-balkenhol-29a22ba/ Bernhard Balkenhol | LinkedIn]</ref>. Until 2014, he served as visiting lecturer at [https://en.wikipedia.org/wiki/University_of_Bielefeld University of Bielefeld], where he already received a [https://en.wikipedia.org/wiki/Diplom diplom] in 1992, and a Ph.D. degree in 1995 under supervision of [[Mathematician#Ahlswede|Rudolf Ahlswede]] and [[Ingo Althöfer]].
His research interests include [[Search|search algorithms]] and [https://en.wikipedia.org/wiki/Data_compression data compression]. Based on [[Jürg Nievergelt|Jürg Nievergelt's]] idea of asking a sequence of [https://en.wikipedia.org/wiki/Yes%E2%80%93no_question yes-no-questions] <ref>[[Jürg Nievergelt]] ('''1977'''). ''[[Workshop Chess and Mathematics#Information|Information content of chess positions]].'' [[ACM#SIG|ACM SIGART Newsletter]], Vol. 62</ref>, Balkenhol elaborated on compression in encoding typical [[Chess Position|chess positions]] with less than 136 bits, as published in the [[ICGA Journal#17_3|ICCA Journal]] <ref>[[Bernhard Balkenhol]] ('''1994'''). ''Data Compression in Encoding Chess Positions.'' [[ICGA Journal#17_3|ICCA Journal, Vol. 17, No. 3]], [http://www.balkenhol.net/papers/icca94.ps.gz zipped ps]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Balkenhol:Bernhard.html dblp: Bernhard Balkenhol]</ref> <ref>[http://www.balkenhol.net/balkenhol.html Dr. Bernhard Balkenhol - Publications]</ref>
==1990 ...==
* [[Ingo Althöfer]], [[Bernhard Balkenhol]] ('''1991'''). ''[https://www.sciencedirect.com/science/article/abs/pii/000437029190042I#! A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Algorithm]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence] Vol. 52, No. 2
* [[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, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], [http://www.balkenhol.net/papers/diplom.ps.gz zipped ps] (German)
* [[Bernhard Balkenhol]] ('''1994'''). ''Data Compression in Encoding Chess Positions.'' [[ICGA Journal#17_3|ICCA Journal, Vol. 17, No. 3]], [http://www.balkenhol.net/papers/icca94.ps.gz zipped ps]
* [[Bernhard Balkenhol]] ('''1995'''). ''[https://pub.uni-bielefeld.de/publication/2437381 Datenkompression mit deterministischen Experten und Systeme teilweise unabhängiger Zufallsvariablen]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], advisor [[Mathematician#Ahlswede|Rudolf Ahlswede]] and [[Ingo Althöfer]] (German)
* [[Bernhard Balkenhol]] ('''1996'''). ''Problems in Sequential and Parallel Game Tree Search''. [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], [http://www.mathematik.uni-bielefeld.de/sfb343/preprints/pre97001.ps.gz zipped ps]
==2000 ...==
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/c/Cai:Ning.html Ning Cai] ('''2002'''). ''Parallel Error Correcting Codes''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 48, No. 4
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/d/Deppe:Christian.html Christian Deppe], [https://dblp.uni-trier.de/pers/hd/f/Fr=ouml=hlich:Martin.html Martin Fröhlich] ('''2006'''). ''A Fast Suffix-Sorting Algorithm''. [https://dblp.uni-trier.de/db/conf/gtitc/gtitc2006.html GTIT-C 2006]
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/k/Kleinew=auml=chter:Christian Christian Kleinewächter] ('''2006'''). ''Identification for Sources''. [https://dblp.uni-trier.de/db/conf/gtitc/gtitc2006.html GTIT-C 2006]
* [[Mathematician#Ahlswede|Rudolf Ahlswede]], [[Bernhard Balkenhol]], [https://dblp.uni-trier.de/pers/hd/d/Deppe:Christian.html Christian Deppe], [https://dblp.uni-trier.de/pers/hd/m/Mashurian:Haik Haik Mashurian], [https://dblp.uni-trier.de/pers/hd/p/Partner:T= T. Partner] ('''2008'''). ''T-shift synchronization codes''. [https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics Discrete Applied Mathematics], Vol. 156, No. 9
=External Links=
* [http://www.balkenhol.net/ Dr. Bernhard Balkenhol - Homepage]
* [https://www.linkedin.com/in/bernhard-balkenhol-29a22ba/ Bernhard Balkenhol | LinkedIn]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=57925 The Mathematics Genealogy Project - Bernhard Balkenhol]
=References=
<references />
'''[[People|Up one level]]'''
