Stability versus speed in a computable algebraic model
M. Ziegler, Theoretical Computer Science (2005) 14–26.

New spectral lower bounds on the bisection width of graphs
S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical Computer Science (2004) 155–174.

Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.

Projections of vector addition system reachability sets are semilinear
H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989) 343–350.

A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.

Simulating probabilistic by deterministic algebraic computation trees
F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.

A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.