Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat: /record/19621

Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. PUB-Library, Release 7.0, User Guide and Function Reference, 2000.
LibreCat: /record/19733

Scheideler, Christian. Probabilistic Methods for Coordination Problems, 2000.
LibreCat: /record/19784

Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.”https://doi.org/10.1109/asap.2000.862400__In Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308, 2000.https://doi.org/10.1109/asap.2000.862400 .
LibreCat: /record/19849
DOI: 10.1109/asap.2000.862400

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.”https://doi.org/10.1007/s002240010006__Theory Comput. Syst. 33, no. 5/6 (2000): 337--391.https://doi.org/10.1007/s002240010006 .
LibreCat: /record/2143
DOI: 10.1007/s002240010006

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.”https://doi.org/10.1137/S0097539799353431__SIAM J. Comput. 30, no. 4 (2000): 1126--1155.https://doi.org/10.1137/S0097539799353431 .
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.
LibreCat: /record/2146

Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.
LibreCat: /record/2147

Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.
LibreCat: /record/2148

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.
LibreCat: /record/2149

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