Publications
Papers are available as gzip-compressed PostScript or PDF.
Diploma thesis and dissertation
- 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. - Datenkompression mit Deterministischen Experten und Systeme Teilweise Unabhängiger Zufallsvariablen
Dissertation, Universität Bielefeld, 1995.
Papers in journals
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.
Data compression in encoding chess positions.
ICCA Journal Vol. 17, No. 3, 132–140, 1994.
Modifications of the Burrows and Wheeler Data Compression Algorithm.
IEEE Data Compression Conference, 1999.
Space Efficient Linear Time Computation of the Burrows and Wheeler Transformation.
In I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker, A. Sarközy, I. Wegener, Z. Zhang (eds.), Numbers, Information and Complexity (Festschrift in honour of Rudolf Ahlswede’s 60th birthday), 375–384, 1999.
Universal Data Compression Based on the Burrows and Wheeler Transformation: Theory and Practice.
IEEE Transactions on Computers Vol. 49, No. 10, October 2000.
Parallel Error Correcting Codes.
IEEE Transactions on Information Theory Vol. 48, No. 4, 959–962, 2002.
A Fast Suffix-Sorting Algorithm.
General Theory of Information Transfer and Combinatorics Vol. 21, 111–114, 2004.
Identification for Sources.
General Theory of Information Transfer and Combinatorics Vol. 21, 115–118, 2004.
T-shift synchronization codes.
General Theory of Information Transfer and Combinatorics Vol. 21, 119–123, 2004.
T-shift synchronization codes.
Discrete Applied Mathematics Vol. 156, 1461–1468, 2008.
Reports in proceedings
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).
Data compression in encoding chess positions.
6th Japan–Benelux Workshop on Coding and Information Theory, Essen, 1996 (ISBN 90-74249-10-8).
Some properties of fix-free codes.
Proceedings First INTAS International Seminar on Coding Theory and Combinatorics, Thahkadzor, Armenia, 20–33, 1996.
Problems in Sequential and Parallel Game Tree Search.
Kolloquium über Kombinatorik, Diskrete Mathematik, Technische Universität Braunschweig, 15.–16.11.1996.
Data compression using deterministic experts.
1997 IEEE International Symposium on Information Theory, 422, 1997.
Some properties of fix-free codes.
Proceedings Second INTAS International Seminar on Coding Theory and Combinatorics, Essen, Germany, 1997.
Reports in the SFB 343 “Discrete Structures in Mathematics”, Faculty of Mathematics, Bielefeld University
A game tree with distinct leaf values which is easy for the alpha-beta algorithm.
Preprint 90-097, 1990.
Datenkompression mit Deterministischen Experten und Systeme Teilweise Unabhängiger Zufallsvariablen.
Ergänzungsreihe 95-009, 1995.
Problems in Sequential and Parallel Game Tree Search.
Ergänzungsreihe 97-001, 1997. · abstract
Some Properties of Fix-Free Codes.
Preprint 97-039, 1997.
Universal Data Compression Based on the Burrows and Wheeler Transformation: Theory and Practice.
Preprint 98-069, 1998. · abstract
Symposium Numbers, Information and Complexity in honour of R. Ahlswede.
Ergänzungsreihe 98-010, 1998.
One Attempt of a Compression Algorithm Using the BWT.
Preprint 99-133, 1999.
Parallel Error Correcting Codes.
Preprint 00-114, 2000.
Identification of Sources.
Preprint 00-120, 2000.
Shift synchronization codes.
Preprint 00-118, 2000.
A Fast Suffix-Sorting Algorithm.
Preprint 01-005, 2001.