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

Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”10.1145/305619.305637__Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.
LibreCat: /record/18965
DOI: 10.1145/305619.305637

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

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

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

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

Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.”10.1007/s002240000119__Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
LibreCat: /record/16502
DOI: 10.1007/s002240000119

Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.”10.1007/978-3-662-01069-3_47__Informatik Aktuell, 1999, doi: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, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”10.1007/3-540-48481-7_9__Algorithms - ESA’ 99, 1999, doi: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. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat: /record/19639

Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.
LibreCat: /record/19735

Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”10.1007/3-540-68530-8_14__Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” Algorithm Engineering, 2nd International Workshop, WAE ’98, Max-Planck-Institut für Informatik, 1998, pp. 133--142.
LibreCat: /record/17863

Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.
LibreCat: /record/18145

Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.
LibreCat: /record/18445

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”10.1007/s002240000096__Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi: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).” SPAA, 1998, pp. 259--268.
LibreCat: /record/2169

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

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.”10.1016/s0304-3975(97)86791-6__Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.”10.1016/s0304-3975(98)00020-6__Theoretical Computer Science, 1998, pp. 175–203, doi: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.”10.1007/bfb0054332__LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.”10.1145/276698.276790__Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998, doi:10.1145/276698.276790.
LibreCat: /record/16563
DOI: 10.1145/276698.276790

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

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

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

Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”10.1007/3-540-63397-9_9__Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi: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. 1997.
LibreCat: /record/18955

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

Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat: /record/2175

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

Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”10.1007/bf01270387__Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
LibreCat: /record/16564
DOI: 10.1007/bf01270387

Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”10.1006/inco.1997.2642__Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.
LibreCat: /record/16565
DOI: 10.1006/inco.1997.2642

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

Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”10.1007/3-540-63397-9_13__5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi: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.”10.1007/bfb0002716__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.”10.1145/258492.258522__Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997, doi: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.”10.1007/3-540-63138-0_21__Solving Irregularly Structured Problems in Parallel, 1997, doi: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.”10.1007/bfb0002741__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”10.1109/sfcs.1997.646117__Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi: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.’”10.1007/978-3-642-60831-5_22__Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.
LibreCat: /record/16693
DOI: 10.1007/978-3-642-60831-5_22

Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
LibreCat: /record/19958

Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996.
LibreCat: /record/17418

Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.
LibreCat: /record/17419

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

Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”10.1007/bfb0024725__Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
LibreCat: /record/18352

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

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi: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.” FOCS, 1996, pp. 370--379.
LibreCat: /record/2183