Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 2002, pp. 83–92.

Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. 2002.

Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.

Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.”10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4__Mathematical Logic Quarterly (MLQ), vol. 48, no. , 2002, pp. 157–81, doi:10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4.

Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.

Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.”10.1007/978-0-387-35608-2_9__Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106, doi:10.1007/978-0-387-35608-2_9.

Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” Simulation Und Visualisierung, SCS European Publishing House, 2002, pp. 71–84.

Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.”10.1007/3-540-45465-9_77__Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.

Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”10.1007/s00224-001-1045-z__Theory of Computing Systems, 2002, pp. 217–45, doi:10.1007/s00224-001-1045-z.

Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.”10.1145/585740.585764__Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002, doi:10.1145/585740.585764.

Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.”10.1145/564870.564910__Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002, doi:10.1145/564870.564910.

Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”10.1007/3-540-45706-2_133__Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.

Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.

Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” Proceedings of the PDPTA 2001, vol. 1, 2001, pp. 463–70.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.”10.1007/s004930170007__Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.

Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.

Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.

Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”10.1007/3-540-44676-1_22__Proceedings of the 9th Annual European Symposium on Algorithms (ESA), 2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.

Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”10.1007/3-540-45294-x_21__Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, doi:10.1007/3-540-45294-x_21.

Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.”10.1145/504331.504333__ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.

Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.”10.1007/3-540-45335-0_23__Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.

Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), vol. AA, 2001, pp. 155–64.

Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–84.

Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–78.

Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.”10.1145/383259.383299__Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.

Meyer auf der Heide, Friedhelm. “Data Management in Networks.”10.1007/3-540-45477-2_2__Graph-Theoretic Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.”10.1007/3-540-45718-6_68__Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68.

Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.

Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms and Implementations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.

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

Bonorden, Olaf, et al. PUB-Library, Release 7.0, User Guide and Function Reference. 2000.

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

Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.”10.1109/asap.2000.862400__Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi:10.1109/asap.2000.862400.

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.”10.1007/s002240010006__Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.”10.1137/S0097539799353431__SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.

Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.

Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.

Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.

Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.

Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.

Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 2000.

Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.”10.1007/s00453-005-1197-3__Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3.

Czumaj, Artur, et al. “Property Testing in Computational Geometry.”10.1007/3-540-45253-2_15__Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15.

Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.”10.1007/3-540-44411-4_34__SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.

Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.

Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.”10.1145/355483.355490__Journal of the ACM, vol. 45, 2000, pp. 944–67, doi:10.1145/355483.355490.

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

Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.”10.1145/341800.341814__Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000, doi:10.1145/341800.341814.

Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.

Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.”10.1007/3-540-44520-x_59__Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.

Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.”10.1137/s009753979529564x__SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.

Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, pp. 112–16.

Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.”10.1109/ipps.1999.760442__Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi:10.1109/ipps.1999.760442.

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”10.1007/s002240000123__Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.

Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.

Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.

Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–41.

Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.

Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.”10.1007/3-540-48447-7_20__Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204, doi:10.1007/3-540-48447-7_20.

Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”10.1145/305619.305637__Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.

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

Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.”10.1006/jagm.1998.0980__Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.

Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.”10.1007/s002240000119__Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.

Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.”10.1007/978-3-662-01069-3_47__Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.

Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”10.1007/3-540-48481-7_9__Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.

Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.

Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.

Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”10.1007/3-540-68530-8_14__Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.

Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” Algorithm Engineering, 2nd International Workshop, WAE ’98, Max-Planck-Institut für Informatik, 1998, pp. 133--142.

Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.

Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”10.1007/s002240000096__Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.

Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.”10.1016/s0304-3975(97)86791-6__Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.

Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.”10.1016/s0304-3975(98)00020-6__Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.

Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.”10.1007/bfb0054332__LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.

Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.”10.1145/276698.276790__Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998, doi:10.1145/276698.276790.

Bäumker, Armin. Communication Efficient Parallel Searching. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.

Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.

Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.

Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”10.1007/3-540-63397-9_9__Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi:10.1007/3-540-63397-9_9.

Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. 1997.

Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.

Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.

Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”10.1007/bf01270387__Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.

Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”10.1006/inco.1997.2642__Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.

Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.”10.1007/s002240000071__Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071.

Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”10.1007/3-540-63397-9_13__5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.”10.1007/bfb0002716__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.

Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.”10.1145/258492.258522__Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997, doi:10.1145/258492.258522.

Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.”10.1007/3-540-63138-0_21__Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.

Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.”10.1007/bfb0002741__Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.

Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”10.1109/sfcs.1997.646117__Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117.