| 2013 | ||
|---|---|---|
| i2 | Holger Boche, Minglai Cai, Ning Cai, Christian Deppe: Secrecy capacities of compound quantum wiretap channels and applications. CoRR abs/1302.3412 (2013) | |
| 2012 | ||
| c9 | Minglai Cai, Ning Cai, Christian Deppe: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. ISIT 2012: 726-730 | |
| i1 | Minglai Cai, Ning Cai, Christian Deppe: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. CoRR abs/1202.0773 (2012) | |
| 2011 | ||
| c8 | Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev: Bounds for threshold and majority group testing. ISIT 2011: 69-73 | |
| c7 | Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev: Majority group testing with density tests. ISIT 2011: 326-330 | |
| 2009 | ||
| j10 | 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 | ||
| j9 | Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe: Searching with lies under error cost constraints. Discrete Applied Mathematics 156(9): 1444-1460 (2008) | |
| j8 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner: T-shift synchronization codes. Discrete Applied Mathematics 156(9): 1461-1468 (2008) | |
| 2006 | ||
| c6 | 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 | |
| c5 | Ferdinando Cicalese, Christian Deppe: Q-Ary Ulam-Renyi Game with Constrained Lies. GTIT-C 2006: 678-694 | |
| c4 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich: A Fast Suffix-Sorting Algorithm. GTIT-C 2006: 719-734 | |
| c3 | Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe: Information Theoretic Models in Language Evolution. GTIT-C 2006: 769-787 | |
| e1 | Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian (Eds.): General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science 4123, Springer 2006, isbn 3-540-46244-9 | |
| 2005 | ||
| j7 | Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe: Information theoretic models in language evolution. Electronic Notes in Discrete Mathematics 21: 97-100 (2005) | |
| j6 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich: A Fast Suffix-Sorting Algorithm. Electronic Notes in Discrete Mathematics 21: 111-114 (2005) | |
| j5 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner: T-shift synchronization codes. Electronic Notes in Discrete Mathematics 21: 119-123 (2005) | |
| j4 | Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe: Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics 21: 173-179 (2005) | |
| j3 | Ferdinando Cicalese, Christian Deppe: Q-ary Ulam-Rényi game with constrained lies. Electronic Notes in Discrete Mathematics 21: 255-261 (2005) | |
| 2004 | ||
| j2 | Christian Deppe: Strategies for the Renyi-Ulam Game with fixed number of lies. Theor. Comput. Sci. 314(1-2): 45-55 (2004) | |
| c2 | Ferdinando Cicalese, Christian Deppe, Daniele Mundici: Q-Ary Ulam-Rényi Game with Weighted Constrained Lies. COCOON 2004: 82-91 | |
| 2003 | ||
| c1 | Ferdinando Cicalese, Christian Deppe: Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. ISAAC 2003: 527-536 | |
| 2000 | ||
| j1 | 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) | |
Data released under the ODC-BY 1.0 license — See also our legal information page