| * | 2008 |
|---|
| 10 | EE | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Haik Mashurian,
T. Partner:
T-shift synchronization codes.
Discrete Applied Mathematics 156(9): 1461-1468 (2008) |
| 2006 |
|---|
| 9 | EE | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Kleinewächter:
Identification for Sources.
GTIT-C 2006: 51-61 |
| 8 | EE | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Martin Fröhlich:
A Fast Suffix-Sorting Algorithm.
GTIT-C 2006: 719-734 |
| 2005 |
|---|
| 7 | EE | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Martin Fröhlich:
A Fast Suffix-Sorting Algorithm.
Electronic Notes in Discrete Mathematics 21: 111-114 (2005) |
| 6 | EE | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Kleinewächter:
Identification for Sources.
Electronic Notes in Discrete Mathematics 21: 115-118 (2005) |
| 5 | EE | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Haik Mashurian,
T. Partner:
T-shift synchronization codes.
Electronic Notes in Discrete Mathematics 21: 119-123 (2005) |
| 2002 |
|---|
| 4 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Ning Cai:
Parallel error correcting codes.
IEEE Transactions on Information Theory 48(4): 959-962 (2002) |
| 2000 |
|---|
| 3 | EE | Bernhard Balkenhol,
Stefan Kurtz:
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice.
IEEE Trans. Computers 49(10): 1043-1053 (2000) |
| 1999 |
|---|
| 2 | EE | Bernhard Balkenhol,
Stefan Kurtz,
Yuri M. Shtarkov:
Modifications of the Burrows and Wheeler Data Compression Algorithm.
Data Compression Conference 1999: 188-197 |
| 1992 |
|---|
| 1 | | Ingo Althöfer,
Bernhard Balkenhol:
A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm.
Artif. Intell. 52(2): 183-190 (1992) |
