M. Ziegler, “Stability versus speed in a computable algebraic model,” Theoretical Computer Science, pp. 14–26, 2005.
LibreCat: /record/15058
DOI: 10.1016/j.tcs.2005.09.053

S. Bezrukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich, “New spectral lower bounds on the bisection width of graphs,” Theoretical Computer Science, pp. 155–174, 2004.
LibreCat: /record/16521
DOI: 10.1016/j.tcs.2004.03.059

F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.
LibreCat: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

H. Kleine Büning, T. Lettmann, and E. W. Mayr, “Projections of vector addition system reachability sets are semilinear,” Theoretical Computer Science, pp. 343–350, 1989.
LibreCat: /record/19818
DOI: 10.1016/0304-3975(89)90055-8

A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” Theoretical Computer Science, pp. 57–68, 1988.
LibreCat: /record/16765
DOI: 10.1016/0304-3975(88)90018-7

F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
LibreCat: /record/16781
DOI: 10.1016/0304-3975(85)90079-9

F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.
LibreCat: /record/16820
DOI: 10.1016/s0304-3975(81)80004-7