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 

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 

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).

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).

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.

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 

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 

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 

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 

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

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

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

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

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 

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 

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 

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

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).

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.

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

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.

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

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 

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 

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 

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

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 

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).

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 

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).

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 

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 

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.

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 

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 

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

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

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

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

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

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 

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 

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

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).

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

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 

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 

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 

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 

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

Bonorden, O., Rieping, I., von Otte, I., &; Juurlink, B. (1998). The Paderborn University BSP (PUB) Library - Design, Implementation and Performance.

Fischer, M., Lukovszki, T., &; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg.https://doi.org/10.1007/3-540-68530-8_14 

Fischer, M., Lukovszki, T., &; Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International Workshop, WAE ’98 (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.

Ziegler, M., Fischer, M., &; Lukovszki, T. (1998). Multimediale Entdeckungsreisen unserer Welt mit dem Internet.

Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität Paderborn.

Scheideler, C., &; Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449.https://doi.org/10.1007/s002240000096 

Adler, M., &; Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).

Feige, U., &; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).

Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390).https://doi.org/10.1007/BFb0052928 

Meyer auf der Heide, F., Schröder, K., &; Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 196, 181–200.https://doi.org/10.1016/s0304-3975(97)86791-6 

Bäumker, A., Dittrich, W., &; Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203.https://doi.org/10.1016/s0304-3975(98)00020-6 

Meyer auf der Heide, F., &; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/bfb0054332 

Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K.,https://doi.org/10.1145/276698.276790__Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98.https://doi.org/10.1145/276698.276790 

Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol. 28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Czumaj, A., &; Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).https://doi.org/10.1007/3-540-63397-9_9 

Strothmann, W.-B., &; Lukovszki, T. (1997). Decremental Biconnectivity on Planar Graphs. Paderborn.

Sohler, C., &; Denny, M. (1997). Encoding a Triangulation as a Permutation of its Point Set. In Proceedings of the 9th Canadian Conference on Computational Geometry (pp. 39–43).

Bock, S., Meyer auf der Heide, F., &; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.

Flammini, M., &; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).

Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &; Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375.https://doi.org/10.1007/bf01270387 

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120.https://doi.org/10.1006/inco.1997.2642 

Meyer auf der Heide, F., Storch, M., &; Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644.https://doi.org/10.1007/s002240000071 

Fischer, M., Meyer auf der Heide, F., &; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. 5th Annual European Symposium on Algorithms (ESA ’97), 1284, 1157–1170.https://doi.org/10.1007/3-540-63397-9_13 

Meyer auf der Heide, F., &; Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/bfb0002716 

Berenbrink, P., Meyer auf der Heide, F., &; Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97.https://doi.org/10.1145/258492.258522 

Bäumker, A., &; Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg.https://doi.org/10.1007/3-540-63138-0_21 

Karaivazoglou, E., &; Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/bfb0002741 

Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. Proceedings 38th Annual Symposium on Foundations of Computer Science.https://doi.org/10.1109/sfcs.1997.646117 

Meyer auf der Heide, F., &; Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.”https://doi.org/10.1007/978-3-642-60831-5_22__In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-60831-5_22 

Schwarze, F., Meyer auf der Heide, F., &; Schröder, K. (1996). Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I, 299–306.

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1996). Contention Resolution in Hashing Based Shared Memory Simulations.

Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &; Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In Proc. of 28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.

Fischer, M., Rethmann, J., &; Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27). Amsterdam: IOS Press.

Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &; Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg.https://doi.org/10.1007/bfb0024725 

Fischer, M., Rethmann, J., &; Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn.

Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281.https://doi.org/10.1016/0304-3975(96)00032-1 

Meyer auf der Heide, F., &; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).

Meyer auf der Heide, F., &; Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.

Cypher, R., Meyer auf der Heide, F., Scheideler, C., &; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.

Ameur, F., Fischer, P., Höffgen, K.-U., &; Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630.https://doi.org/10.1007/bf03036467 

Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427.https://doi.org/10.1007/bf01955042 

Karp, R. M., Luby, M., &; Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542.https://doi.org/10.1007/bf01940878 

Gil, J., Meyer auf der Heide, F., &; Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955.https://doi.org/10.1137/s0097539793255722 

Meyer auf der Heide, F., &; Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICAL. Berlin, Heidelberg.https://doi.org/10.1007/3-540-61440-0 

Berenbrink, P., Meyer auf der Heide, F., &; Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60922-9_16 

Stemann, V. (1995). Contention Resolution in Hashing Based Shared Memory Simulations (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Czumaj, A. (1995). Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.