Diploma Thesis and Dissertation

  1. k-reguläre Minimax-Bäume mit distinkten Blattwerten, die
    unabhängig von ihrer Sortierung leicht für den Alpha-Beta-Algorithmus sind,

    Diplomarbeit, Universität Bielefeld, 1992.

  2. Datenkompression mit Deterministischen Experten und Systeme Teilweise Unabhängiger Zufallsvariablen,
    Dissertation, Universität Bielefeld, 1995.

    Papers in Journals

  3. 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).

  4. Balkenhol, Bernhard
    Data compression in encoding chess positions.
    ICCA Journal Vol. 17 No. 3, 132--140, 1994.

  5. Balkenhol, Bernhard; Kurtz, Stefan; Shtarkov, Yuri M.
    Modifications of the Burrows and Wheeler Data Compression Algorithm.
    IEEE Data Compression Conference 1999.

  6. 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.

  7. Bernhard Balkenhol, Stefan Kurtz
    Universal Data Compression Based on the Burrows and Wheeler-Transformation: Theory and Practice,
    IEEE Trans. on Computers, vol 49, no. 10, 2000

    Reports in Proceedings

  8. 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).

  9. 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.

  10. Balkenhol, Bernhard
    Data Compression in Encoding Chess Positions,
    6th Japan--Benelux Workshop on Coding and Information Theory, Essen, 1996 (ISBN 90--74249--10--8).

  11. Bernhard Balkenhol
    Problems in Sequential and Parallel Game Tree Search
    Presented at Kolloquium über Kombinatorik, Diskrete Mathematik, Technische Universiät Braunschweig, 15.-16.11.1996.

    Reports in the SFB343 Discrete Structures in Mathematics

  12. 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.

  13. Bernhard Balkenhol
    Datenkompression mit Deterministischen Experten und Systeme Teilweise Unabhängiger Zufallsvariablen
    Ergänzungsreihe 95-009, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1995.

  14. 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.

  15. Bernhard Balkenhol
    Problems in Sequential and Parallel Game Tree Search
    Ergänzungsreihe 97-001, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1997.

  16. Bernhard Balkenhol, Stefan Kurtz
    Universal Data Compression Based on the Burrows and Wheeler-Transformation: Theory and Practice
    Preprint 98-069, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1998.

  17. Bernhard Balkenhol, Yuri M. Shtarkov
    One Attempt of a Compression Algorithm Using the BWT
    Preprint 99-133, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1999.



icon Hauptseite     icon Preprints im SFB icon main site
 
For any questions and problems with this web site please email to bernhard@Mathematik.Uni-Bielefeld.DE. Last change: 27/06/2000