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. I. Althöfer,B. Balkenhol
    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. B. Balkenhol
    Data compression in encoding chess positions.
    ICCA Journal Vol. 17 No. 3, 132--140, 1994.

  5. B. Balkenhol, S. Kurtz, Y.M. Shtarkov,
    Modifications of the Burrows and Wheeler Data Compression Algorithm.
    IEEE Data Compression Conference 1999.

  6. B. Balkenhol, S. Kurtz,
    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.     1999.

  7. B. Balkenhol, S. Kurtz,
    Universal Data Compression Based on the Burrows and Wheeler-Transformation: Theory and Practice,
    IEEE Trans. on Computers, Vol 49. No 10, October 2000.

  8. R. Ahlswede, B. Balkenhol, N. Cai,
    Parallel Error Correcting Codes,
    IEEE Trans. on Information Theory, Vol 48. No. 4, 959-962, 2002

  9. R. Ahlswede, B. Balkenhol, C. Deppe and M. Fröhlich,
    A Fast Suffix-Sorting Algorithm,
    General Theory of Information Transfer and Combinatorics, Vol 21, 111-114, 2004

  10. R. Ahlswede, B. Balkenhol and C. Kleinewächter,
    Identification for Sources,
    General Theory of Information Transfer and Combinatorics, Vol 21, 115-118, 2004

  11. R. Ahlswede, B. Balkenhol, C. Deppe, H. Mashurian And T. Partner,
    T-shift synchronization codes,
    General Theory of Information Transfer and Combinatorics, Vol 21, 119-123, 2004

  12. R. Ahlswede, B. Balkenhol, C. Deppe, H. Mashurian And T. Partner,
    T-shift synchronization codes,
    Discrete Applied Mathematics, Vol 156, 1461-1468, 2008

    Reports in Proceedings

  13. B. Balkenhol,
    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).

  14. B. Balkenhol
    Data compression in encoding chess positions.
    In 6th Japan-Benelux Workshop on Coding and Information Theory,Essen , 1996. (ISBN 90-74249-10-8)

  15. B. Balkenhol
    Data compression using deterministic experts.
    In 1997 IEEE-Intenational Symposium on Information Theory, 422, 1997.

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

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

  18. R. Ahlswede, B. Balkenhol and L. Khachatrian,
    Some properties of Fix--Free-Codes,
    Proceedings Second INTAS International Seminar on Coding Theory and Combinatorics, Essen, Germany, 1997.

    Reports in the SFB343 Discrete Structures in Mathematics

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

  20. B. 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.

  21. B. Balkenhol,
    Problems in Sequential and Parallel Game Tree Search (Abstract)
    Ergänzungsreihe 97-001, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1997.

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

  23. B. Balkenhol, S. Kurtz,
    Universal Data Compression Based on the Burrows and Wheeler-Transformation: Theory and Practice (Abstract)
    Preprint 98-069, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1998.

  24. B. Balkenhol, U. Tamm (editors),
    Symposium Numbers, Information and Complexity in honour of R. Ahlswede, Ergänzungsreihe 98-010, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 1998.

  25. B. Balkenhol, Y.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.

  26. R. Ahlswede, B. Balkenhol, N. Cai,
    Parallel Error Correcting Codes,
    Preprint 00-114, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 2000.

  27. R. Ahlswede, B. Balkenhol, C. Kleinewächter,
    Identifictation of Sources,
    Preprint 00-120, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 2000.

  28. R. Ahlswede, B. Balkenhol, T. Partner,
    Shift synchronization codes,
    Preprint 00-118, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 2000.

  29. R. Ahlswede, B. Balkenhol, M. Fröhlich,
    A Fast Suffix-Sorting Algorithm,
    Preprint 01-005, SFB343: Discrete Structures in Mathematics, Falculty of Mathematics, University of Bielefeld, 2001.


icon main site
 
For any questions and problems with this web site please email to bernhard@balkenhol.net. Last change: 13/03/2006