Althöfer, Ingo; Balkenhol, Bernhard
A game tree with distinct leaf values which is easy for the
alpha-beta algorithm. Artificial Intelligence 52, no. 2, 183-190, P1-P4 (1991).
Balkenhol, Bernhard; Kurtz, Stefan
Space Efficient Linear Time Computation of the Burrows and Wheeler Transformation. I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker,
A. Sarközy, I. Wegener and Z. Zhang (eds.),
Numbers, Information and complexity
(Festschrift in honour of Rudolf Ahlswede's 60th Birthday),
pages 375-384,
1999.
Balkenhol, Bernhard
Data compression using deterministic experts,
5th Japan--Benelux Workshop on Coding and Information Theory, Hakone, Japan,
7.1--7.14, 1996 (ISBN 90--74249--08--6).
R. Ahlswede, B. Balkenhol and L. Khachatrian,
Some properties of Fix--Free-Codes,
Proceedings First INTAS International Seminar on Coding Theory and
Combinatorics, Thahkadzor, Armenia, 20--33, 1996.
Balkenhol, Bernhard
Data Compression in Encoding Chess Positions,
6th Japan--Benelux Workshop on Coding and Information Theory, Essen,
1996 (ISBN 90--74249--10--8).
Reports in the SFB343 Discrete Structures in Mathematics
I. Althöfer, B. Balkenhol A game tree with distinct leaf values which is easy for the alpha-beta algorithm.
Preprint 90-097, SFB343: Discrete Structures in Mathematics,
Falculty of Mathematics, University of Bielefeld, 1990.
R. Ahlswede, B. Balkenhol, L. Khachatrian Some Properties of Fix-Free Codes
Preprint 97-039, SFB343: Discrete Structures in Mathematics,
Falculty of Mathematics, University of Bielefeld, 1997.