| |
| 2009 | ||
|---|---|---|
| 3 | EE | Henning Wunderlich: On Toda's Theorem in Structural Communication Complexity. SOFSEM 2009: 609-620 |
| 2007 | ||
| 2 | EE | Martin Dietzfelbinger, Henning Wunderlich: A characterization of average case communication complexity. Inf. Process. Lett. 101(6): 245-249 (2007) |
| 2006 | ||
| 1 | EE | Karl-Heinz Niggl, Henning Wunderlich: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. SIAM J. Comput. 35(5): 1122-1147 (2006) |
| 1 | Martin Dietzfelbinger | [2] |
| 2 | Karl-Heinz Niggl | [1] |