- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| 8 |      | Henning Wunderlich, Stefan Arnold: On a singular value method in quantum communication complexity. Electronic Colloquium on Computational Complexity (ECCC) 17: 24 (2010) |
| 7 | | Henning Wunderlich: On a Theorem of Razborov. Electronic Colloquium on Computational Complexity (ECCC) 17: 86 (2010) |
| 6 | | Karl-Heinz Niggl, Henning Wunderlich: Implicit characterizations of FPTIME and NC revisited. J. Log. Algebr. Program. 79(1): 47-60 (2010) |
| 2009 | ||
| 5 | | Henning Wunderlich: On Toda's Theorem in Structural Communication Complexity. SOFSEM 2009: 609-620 |
| 4 | | Henning Wunderlich: On cover-structure graphs. Discrete Applied Mathematics 157(15): 3289-3299 (2009) |
| 3 | | Henning Wunderlich: Contributions to structural communication complexity. Ilmenau University of Technology 2009: 1-73 |
| 2007 | ||
| 2 | | Martin Dietzfelbinger, Henning Wunderlich: A characterization of average case communication complexity. Inf. Process. Lett. 101(6): 245-249 (2007) |
| 2006 | ||
| 1 | | Karl-Heinz Niggl, Henning Wunderlich: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. SIAM J. Comput. 35(5): 1122-1147 (2006) |
| 1 | Stefan Arnold | [8] |
| 2 | Martin Dietzfelbinger | [2] |
| 3 | Karl-Heinz Niggl | [1] [6] |
Colors in the list of coauthors
Last update Sat May 26 02:31:23 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page