Christian Deppe

	2012
20		Minglai Cai, Ning Cai, Christian Deppe: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels CoRR abs/1202.0773: (2012)
	2011
19		Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev: Majority group testing with density tests. ISIT 2011: 326-330
18		Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev: Bounds for threshold and majority group testing. ISIT 2011: 69-73
	2009
17		Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro: Two Batch Search With Lie Cost. IEEE Transactions on Information Theory 55(4): 1433-1439 (2009)
	2008
16		Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe: Searching with lies under error cost constraints. Discrete Applied Mathematics 156(9): 1444-1460 (2008)
15		Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner: T-shift synchronization codes. Discrete Applied Mathematics 156(9): 1461-1468 (2008)
	2006
14		Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian: General Theory of Information Transfer and Combinatorics Springer 2006
13		Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev: Non--binary error correcting codes with noiseless feedback, localized errors, or both. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006
12		Ferdinando Cicalese, Christian Deppe: Q-Ary Ulam-Renyi Game with Constrained Lies. GTIT-C 2006: 678-694
11		Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich: A Fast Suffix-Sorting Algorithm. GTIT-C 2006: 719-734
10		Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe: Information Theoretic Models in Language Evolution. GTIT-C 2006: 769-787
	2005
9		Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich: A Fast Suffix-Sorting Algorithm. Electronic Notes in Discrete Mathematics 21: 111-114 (2005)
8		Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner: T-shift synchronization codes. Electronic Notes in Discrete Mathematics 21: 119-123 (2005)
7		Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe: Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics 21: 173-179 (2005)
6		Ferdinando Cicalese, Christian Deppe: Q-ary Ulam-Rényi game with constrained lies. Electronic Notes in Discrete Mathematics 21: 255-261 (2005)
5		Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe: Information theoretic models in language evolution. Electronic Notes in Discrete Mathematics 21: 97-100 (2005)
	2004
4		Ferdinando Cicalese, Christian Deppe, Daniele Mundici: Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. COCOON 2004: 82-91
3		Christian Deppe: Strategies for the Renyi-Ulam Game with fixed number of lies. Theor. Comput. Sci. 314(1-2): 45-55 (2004)
	2003
2		Ferdinando Cicalese, Christian Deppe: Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. ISAAC 2003: 527-536
	2000
1		Christian Deppe: Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes. Discrete Mathematics 224(1-3): 79-98 (2000)

Coauthor Index

1	Rudolf Ahlswede	[5] [7] [8] [9] [10] [11] [13] [14] [15] [16] [17] [18] [19]
2	Erdal Arikan	[5] [10]
3	Harout K. Aydinian	[14]
4	Bernhard Balkenhol	[8] [9] [11] [15]
5	Lars Bäumer	[5] [10] [14]
6	Vladimir Blinovsky	[14]
7	Minglai Cai	[20]
8	Ning Cai	[14] [20]
9	Ferdinando Cicalese	[2] [4] [6] [7] [12] [16] [17]
10	Martin Fröhlich	[9] [11]
11	Vladimir Lebedev	[13] [18] [19]
12	Haik Mashurian	[8] [14] [15]
13	Daniele Mundici	[4]
14	T. Partner	[8] [15]
15	Ugo Vaccaro	[17]

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page