Bonorden, O., von zur Gathen, J., Gerhard, J., &; Müller, O. (2001). Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18.https://doi.org/10.1145/504331.504333 
LibreCat: /record/23731
DOI: 10.1145/504331.504333

Ziegler, M., &; Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45335-0_23 
LibreCat: /record/18152
DOI: 10.1007/3-540-45335-0_23

Ziegler, M., &; Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).
LibreCat: /record/18166

Brattka, V., &; Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01) (pp. 181–184).
LibreCat: /record/18168

Klein, J., &; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp. 275–278). Bad Schussenried.
LibreCat: /record/18370

Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &; Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01.https://doi.org/10.1145/383259.383299 
LibreCat: /record/16492
DOI: 10.1145/383259.383299

Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg.https://doi.org/10.1007/3-540-45477-2_2 
LibreCat: /record/16493
DOI: 10.1007/3-540-45477-2_2

Meyer auf der Heide, F., &; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg.https://doi.org/10.1007/3-540-45718-6_68 
LibreCat: /record/16494
DOI: 10.1007/3-540-45718-6_68

Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer .https://doi.org/10.1007/3-540-44676-1 
LibreCat: /record/16722
DOI: 10.1007/3-540-44676-1

Rieping, I. (2000). Communication in Parallel Systems-Models, Algorithms and Implementations (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19620

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

Bonorden, O., Rieping, I., von Otte, I., &; Juurlink, B. (2000). PUB-Library, Release 7.0, User Guide and Function Reference.
LibreCat: /record/19733

Scheideler, C. (2000). Probabilistic Methods for Coordination Problems.
LibreCat: /record/19784

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: /record/19849
DOI: 10.1109/asap.2000.862400

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: /record/2143
DOI: 10.1007/s002240010006

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: /record/2145
DOI: 10.1137/S0097539799353431

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat: /record/2146

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: /record/2147

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: /record/2148

Brinkmann, A., Salzwedel, K., &; Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).
LibreCat: /record/2149

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: /record/2150

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: /record/17865

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: /record/18962
DOI: 10.1007/s00453-005-1197-3

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: /record/17990
DOI: 10.1007/3-540-45253-2_15

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: /record/18146
DOI: 10.1007/3-540-44411-4_34

Ziegler, M., &; Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 73–79).
LibreCat: /record/18150

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: /record/18446
DOI: 10.1145/355483.355490

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: /record/2211

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: /record/16495
DOI: 10.1145/341800.341814

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: /record/16496

Meyer auf der Heide, F., Kutyowski, 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: /record/16497
DOI: 10.1007/3-540-44520-x_59

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739.https://doi.org/10.1137/s009753979529564x 
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

Meyer auf der Heide, F., &; Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn, 112–116.
LibreCat: /record/16345

Bonorden, O., Juurlink, B., Von Otte, I., &; Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104.https://doi.org/10.1109/ipps.1999.760442 
LibreCat: /record/19732
DOI: 10.1109/ipps.1999.760442

Flammini, M., &; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.https://doi.org/10.1007/s002240000123 
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, P., &; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
LibreCat: /record/2164

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).
LibreCat: /record/2165

Fischer, M., Lukovszki, T., &; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver.
LibreCat: /record/17864

Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99) (pp. 136–141).
LibreCat: /record/18747

Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18942

Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204).https://doi.org/10.1007/3-540-48447-7_20 
LibreCat: /record/18959
DOI: 10.1007/3-540-48447-7_20

Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &; Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99 (pp. 165–174).https://doi.org/10.1145/305619.305637 
LibreCat: /record/18965
DOI: 10.1145/305619.305637

Sohler, C. (1999). Generating Random Star-Shaped Polygons. In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99) (pp. 174–177).
LibreCat: /record/18576

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat: /record/2210

Scheideler, C., &; Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).
LibreCat: /record/2166

Meyer auf der Heide, F., &; Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131.https://doi.org/10.1006/jagm.1998.0980 
LibreCat: /record/16501
DOI: 10.1006/jagm.1998.0980

Berenbrink, P., Meyer auf der Heide, F., &; Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300.https://doi.org/10.1007/s002240000119 
LibreCat: /record/16502
DOI: 10.1007/s002240000119

Mayr, E. W., Meyer auf der Heide, F., &; Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell.https://doi.org/10.1007/978-3-662-01069-3_47 
LibreCat: /record/17052
DOI: 10.1007/978-3-662-01069-3_47

Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg.https://doi.org/10.1007/3-540-48481-7_9 
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Vöcking, B. (1998). Static and Dynamic Data Management in Networks (Vol. 46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19639