Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.

PUB-Library, Release 7.0, User Guide and Function Reference
O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.

Probabilistic Methods for Coordination Problems
C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.

Tradeoff analysis and architecture design of a hybrid hardware/software sorter
M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.

Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.

Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.

Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.

Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.

Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.

A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.

Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes
M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.

I/O-Efficient Well-Separated Pair Decomposition and Applications
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.

Property Testing in Computational Geometry
A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.

Computing the Dimension of Linear Subspaces
M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.

Computing Cut Numbers
M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.

Periodification Scheme: Constructing Sorting Networks with Constant Period
K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.

A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems 
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.

Data management in hierarchical bus networks
F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.

Caching in networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.