Meyer auf der Heide, Friedhelm, Mirosaw Kutyowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.”https://doi.org/10.1007/3-540-44520-x_59__In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000.https://doi.org/10.1007/3-540-44520-x_59 .
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.”https://doi.org/10.1137/s009753979529564x__SIAM Journal on Computing, 2000, 1703–39.https://doi.org/10.1137/s009753979529564x .
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, 112–16.
LibreCat: /record/16345

Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.”https://doi.org/10.1109/ipps.1999.760442__In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104, 1999.https://doi.org/10.1109/ipps.1999.760442 .
LibreCat: /record/19732
DOI: 10.1109/ipps.1999.760442

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”https://doi.org/10.1007/s002240000123__Theory Comput. Syst. 32, no. 3 (1999): 387--420.https://doi.org/10.1007/s002240000123 .
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat: /record/2164

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat: /record/2165

Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver, 1999.
LibreCat: /record/17864

Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 136–41, 1999.
LibreCat: /record/18747

Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat: /record/18942

Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.”https://doi.org/10.1007/3-540-48447-7_20__In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999.https://doi.org/10.1007/3-540-48447-7_20 .
LibreCat: /record/18959
DOI: 10.1007/3-540-48447-7_20

Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”https://doi.org/10.1145/305619.305637__In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 165–74, 1999.https://doi.org/10.1145/305619.305637 .
LibreCat: /record/18965
DOI: 10.1145/305619.305637

Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77, 1999.
LibreCat: /record/18576

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
LibreCat: /record/2210

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.
LibreCat: /record/2166

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.”https://doi.org/10.1006/jagm.1998.0980__Journal of Algorithms, 1999, 105–31.https://doi.org/10.1006/jagm.1998.0980 .
LibreCat: /record/16501
DOI: 10.1006/jagm.1998.0980

Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.”https://doi.org/10.1007/s002240000119__Theory of Computing Systems, 1999, 281–300.https://doi.org/10.1007/s002240000119 .
LibreCat: /record/16502
DOI: 10.1007/s002240000119

Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.”https://doi.org/10.1007/978-3-662-01069-3_47__In Informatik Aktuell. Berlin, Heidelberg, 1999.https://doi.org/10.1007/978-3-662-01069-3_47 .
LibreCat: /record/17052
DOI: 10.1007/978-3-662-01069-3_47

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”https://doi.org/10.1007/3-540-48481-7_9__In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999.https://doi.org/10.1007/3-540-48481-7_9 .
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Vöcking, Berthold. Static and Dynamic Data Management in Networks. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat: /record/19639

Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.
LibreCat: /record/19735

Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”https://doi.org/10.1007/3-540-68530-8_14__In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998.https://doi.org/10.1007/3-540-68530-8_14 .
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

Fischer, Matthias, Tamas Lukovszki, and Martin  Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, WAE ’98, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.
LibreCat: /record/17863

Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat: /record/18145

Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität Paderborn, 1998.
LibreCat: /record/18445

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”https://doi.org/10.1007/s002240000096__Theory Comput. Syst. 31, no. 4 (1998): 425--449.https://doi.org/10.1007/s002240000096 .
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
LibreCat: /record/2169

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
LibreCat: /record/2170

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998.https://doi.org/10.1007/BFb0052928 .
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

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

Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.”https://doi.org/10.1007/bfb0054332__In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998.https://doi.org/10.1007/bfb0054332 .
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.”https://doi.org/10.1145/276698.276790__In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998.https://doi.org/10.1145/276698.276790 .
LibreCat: /record/16563
DOI: 10.1145/276698.276790

Bäumker, Armin. Communication Efficient Parallel Searching. Vol. 28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19631

Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19636

Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19637

Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”https://doi.org/10.1007/3-540-63397-9_9__In Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.https://doi.org/10.1007/3-540-63397-9_9 .
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat: /record/18955

Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational Geometry, 39–43, 1997.
LibreCat: /record/18575

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

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