Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
792 Publications
2000 | Dissertation | LibreCat-ID: 19621
M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 19733
O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference. 2000.
LibreCat
| Files available
2000 | Habilitation | LibreCat-ID: 19784
C. Scheideler, Probabilistic Methods for Coordination Problems. 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 19849
M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi: 10.1109/asap.2000.862400.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 | 
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 18150
M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
A. Czumaj and C. 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, 2000, pp. 38–47.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 16495
F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: 10.1145/341800.341814.
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 16496
F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 2000, pp. 430–439.
LibreCat