25,161
edits
Changes
no edit summary
'''Bernhard Balkenhol''',<br/>
a German mathematician, computer scientist and authorized officer and CEO in the [https://en.wikipedia.org/wiki/Information_technology IT] indutry industry <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>.
