A Hierarchy Theorem for Pram-Based Complexity Classes. - Walter W. Kirchherr (FSTTCS, 1988)

Transposition of an 1*1 Matrix Requires O(log 1) Reversals on Conservative Turing Machines. - Walter W. Kirchherr (Inf. Process. Lett., 1988)

Kolmogorov Complexity and Random Graphs. - Walter W. Kirchherr (Inf. Process. Lett., 1992)

NEPS operations on cordial graphs. - Walter W. Kirchherr (Discret. Math., 1993)

The Combinatorial Complexity of a Finite String. - Felix Frayman; Valery Kanevsky; Walter W. Kirchherr (MFCS, 1994)

A Note on the Road-Coloring Conjecture. - E. Gocka; Walter W. Kirchherr; Edward F. Schmeichel (Ars Comb., 1998)

Graph Operations and Zipfian Degree Distributions. - Walter W. Kirchherr (Electron. Notes Discret. Math., 2002)