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

Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.”https://doi.org/10.1007/bf01270387__Computational Complexity, 1997, 357–75.https://doi.org/10.1007/bf01270387 .
LibreCat: /record/16564
DOI: 10.1007/bf01270387

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”https://doi.org/10.1006/inco.1997.2642__Information and Computation, 1997, 103–20.https://doi.org/10.1006/inco.1997.2642 .
LibreCat: /record/16565
DOI: 10.1006/inco.1997.2642

Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.”https://doi.org/10.1007/s002240000071__Theory of Computing Systems, 1997, 627–44.https://doi.org/10.1007/s002240000071 .
LibreCat: /record/16567
DOI: 10.1007/s002240000071

Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”https://doi.org/10.1007/3-540-63397-9_13__In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997.https://doi.org/10.1007/3-540-63397-9_13 .
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.”https://doi.org/10.1007/bfb0002716__In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997.https://doi.org/10.1007/bfb0002716 .
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.”https://doi.org/10.1145/258492.258522__In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997.https://doi.org/10.1145/258492.258522 .
LibreCat: /record/16604
DOI: 10.1145/258492.258522

Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.”https://doi.org/10.1007/3-540-63138-0_21__In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997.https://doi.org/10.1007/3-540-63138-0_21 .
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.”https://doi.org/10.1007/bfb0002741__In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997.https://doi.org/10.1007/bfb0002741 .
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”https://doi.org/10.1109/sfcs.1997.646117__In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.https://doi.org/10.1109/sfcs.1997.646117 .
LibreCat: /record/16689
DOI: 10.1109/sfcs.1997.646117

Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”https://doi.org/10.1007/978-3-642-60831-5_22__In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg, 1997.https://doi.org/10.1007/978-3-642-60831-5_22 .
LibreCat: /record/16693
DOI: 10.1007/978-3-642-60831-5_22

Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I (1996): 299–306.
LibreCat: /record/19958

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB, University of Paderborn, 1996.
LibreCat: /record/17418

Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.
LibreCat: /record/17419

Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost Model for the Communication Time in Parallel Programs.” In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), 13–27. Amsterdam: IOS Press, 1996.
LibreCat: /record/17483

Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”https://doi.org/10.1007/bfb0024725__In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996.https://doi.org/10.1007/bfb0024725 .
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 1996.
LibreCat: /record/18352

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