Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”https://doi.org/10.1016/j.tcs.2005.09.053__Theoretical Computer Science, 2005, 14–26.https://doi.org/10.1016/j.tcs.2005.09.053 .
LibreCat: /record/15058
DOI: 10.1016/j.tcs.2005.09.053

Bezrukov, S., R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich. “New Spectral Lower Bounds on the Bisection Width of Graphs.”https://doi.org/10.1016/j.tcs.2004.03.059__Theoretical Computer Science, 2004, 155–74.https://doi.org/10.1016/j.tcs.2004.03.059 .
LibreCat: /record/16521
DOI: 10.1016/j.tcs.2004.03.059

Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.”https://doi.org/10.1016/s0304-3975(97)86791-6__Theoretical Computer Science 196 (1998): 181–200.https://doi.org/10.1016/s0304-3975(97)86791-6 .
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1016/s0304-3975(98)00020-6__Theoretical Computer Science, 1998, 175–203.https://doi.org/10.1016/s0304-3975(98)00020-6 .
LibreCat: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

Kleine Büning, Hans, Theodor Lettmann, and Ernst W. Mayr. “Projections of Vector Addition System Reachability Sets Are Semilinear.”https://doi.org/10.1016/0304-3975(89)90055-8__Theoretical Computer Science, 1989, 343–50.https://doi.org/10.1016/0304-3975(89)90055-8 .
LibreCat: /record/19818
DOI: 10.1016/0304-3975(89)90055-8

Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”https://doi.org/10.1016/0304-3975(88)90018-7__Theoretical Computer Science, 1988, 57–68.https://doi.org/10.1016/0304-3975(88)90018-7 .
LibreCat: /record/16765
DOI: 10.1016/0304-3975(88)90018-7

Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.”https://doi.org/10.1016/0304-3975(85)90079-9__Theoretical Computer Science, 1985, 325–30.https://doi.org/10.1016/0304-3975(85)90079-9 .
LibreCat: /record/16781
DOI: 10.1016/0304-3975(85)90079-9

Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.”https://doi.org/10.1016/s0304-3975(81)80004-7__Theoretical Computer Science, 1981, 315–22.https://doi.org/10.1016/s0304-3975(81)80004-7 .
LibreCat: /record/16820
DOI: 10.1016/s0304-3975(81)80004-7