Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Bernhard
Last name:	Balkenhol
DBLP:	36/4817
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 10  

Select a publication
Show	Title	Venue	Rating	Date
	Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner. T-shift synchronization codes.	Discrete Applied Mathematics 2008, Volume 156	(0)	2008
	Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich. A Fast Suffix-Sorting Algorithm.	General Theory of Information Transfer and Combinatorics 2006	(0)	2006
	Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter. Identification for Sources.	General Theory of Information Transfer and Combinatorics 2006	(0)	2006
	Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter. Identification for Sources.	Electronic Notes in Discrete Mathematics 2005, Volume 21	(0)	2005
	Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich. A Fast Suffix-Sorting Algorithm.	Electronic Notes in Discrete Mathematics 2005, Volume 21	(0)	2005
	Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner. T-shift synchronization codes.	Electronic Notes in Discrete Mathematics 2005, Volume 21	(0)	2005
	Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai. Parallel error correcting codes.	IEEE Transactions on Information Theory 2002, Volume 48	(0)	2002
	Bernhard Balkenhol, Stefan Kurtz. Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice.	IEEE Trans. Computers 2000, Volume 49	(0)	2000
	Bernhard Balkenhol, Stefan Kurtz, Yuri M. Shtarkov. Modifications of the Burrows and Wheeler Data Compression Algorithm.	Data Compression Conference 1999	(0)	1999
	Ingo Althöfer, Bernhard Balkenhol. A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm.	Artif. Intell. 1991, Volume 52	(0)	1992

Your query returned 10 matches in the database.