Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.
LibreCat: /record/2175

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
LibreCat: /record/2179

Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.
LibreCat: /record/2181

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”https://doi.org/10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2 (1996): 245--281.https://doi.org/10.1016/0304-3975(96)00032-1 .
LibreCat: /record/2182
DOI: 10.1016/0304-3975(96)00032-1

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.
LibreCat: /record/2183

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.
LibreCat: /record/2184

Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.
LibreCat: /record/2186

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”https://doi.org/10.1007/3-540-60313-1_154__In ESA, 341--354. Lecture Notes in Computer Science, 1995.https://doi.org/10.1007/3-540-60313-1_154 .
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.
LibreCat: /record/2207

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.
LibreCat: /record/2208