Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. - Karl-Heinz Niggl; Henning Wunderlich (SIAM J. Comput., 2006)

A characterization of average case communication complexity. - Martin Dietzfelbinger; Henning Wunderlich (Inf. Process. Lett., 2007)

On Toda's Theorem in Structural Communication Complexity. - Henning Wunderlich (SOFSEM, 2009)

On cover-structure graphs. - Henning Wunderlich (Discret. Appl. Math., 2009)

Contributions to structural communication complexity. - Henning Wunderlich (2009)

On a singular value method in quantum communication complexity. - Henning Wunderlich; Stefan Arnold (Electron. Colloquium Comput. Complex., 2010)

Implicit characterizations of FPTIME and NC revisited. - Karl-Heinz Niggl; Henning Wunderlich (J. Log. Algebraic Methods Program., 2010)

On a Theorem of Razborov. - Henning Wunderlich (Comput. Complex., 2012)

A note on a problem in communication complexity - Henning Wunderlich (CoRR, 2012)