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
Westermann, M. (2000). Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 19733
Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (2000). PUB-Library, Release 7.0, User Guide and Function Reference.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 19849
Bednara, M., Beyer, O., Teich, J., & Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308. https://doi.org/10.1109/asap.2000.862400
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2143
Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006
LibreCat
| DOI
2000 | Journal Article | LibreCat-ID: 2145
Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2146 | 
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2147 |
Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).
LibreCat
| Files available
2000 | Journal Article | LibreCat-ID: 2148
Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.
LibreCat
2000 | Conference Paper | LibreCat-ID: 2149 |
Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 2150 |
Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.
LibreCat
| Files available
2000 | Report | LibreCat-ID: 17865
Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn.
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 18962
Govindarajan, S., Lukovszki, T., Maheshwari, A., & Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614). https://doi.org/10.1007/s00453-005-1197-3
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, A., Sohler, C., & Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-45253-2_15
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, M., & Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-44411-4_34
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18150
Ziegler, M., & Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 73–79).
LibreCat
2000 | Journal Article | LibreCat-ID: 18446
Lorys, K., Wanka, R., Oesterdiekhoff, B., & Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967. https://doi.org/10.1145/355483.355490
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 2211 |
Czumaj, A., & Scheideler, C. (2000). 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 (pp. 38–47).
LibreCat
| Files available
2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00. https://doi.org/10.1145/341800.341814
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).
LibreCat
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59
LibreCat
| DOI