Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
LibreCat: /record/2150

Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.
LibreCat: /record/17865

Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.”https://doi.org/10.1007/s00453-005-1197-3__In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000.https://doi.org/10.1007/s00453-005-1197-3 .
LibreCat: /record/18962
DOI: 10.1007/s00453-005-1197-3

Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.”https://doi.org/10.1007/3-540-45253-2_15__In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-45253-2_15 .
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”https://doi.org/10.1007/3-540-44411-4_34__In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000.https://doi.org/10.1007/3-540-44411-4_34 .
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000.
LibreCat: /record/18150

Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.”https://doi.org/10.1145/355483.355490__Journal of the ACM 45 (2000): 944–67.https://doi.org/10.1145/355483.355490 .
LibreCat: /record/18446
DOI: 10.1145/355483.355490

Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.
LibreCat: /record/2211

Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.”https://doi.org/10.1145/341800.341814__In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.https://doi.org/10.1145/341800.341814 .
LibreCat: /record/16495
DOI: 10.1145/341800.341814

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 430–439, 2000.
LibreCat: /record/16496

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