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

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 
LibreCat: /record/17412
DOI: 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.
LibreCat: /record/17863

Ziegler, M., Fischer, M., &; Lukovszki, T. (1998). Multimediale Entdeckungsreisen unserer Welt mit dem Internet.
LibreCat: /record/18145

Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität Paderborn.
LibreCat: /record/18445

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

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

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

Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390).https://doi.org/10.1007/BFb0052928 
LibreCat: /record/2185
DOI: 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 
LibreCat: /record/16503
DOI: 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 
LibreCat: /record/16504
DOI: 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 
LibreCat: /record/16562
DOI: 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 
LibreCat: /record/16563
DOI: 10.1145/276698.276790

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

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

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

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 
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

Strothmann, W.-B., &; Lukovszki, T. (1997). Decremental Biconnectivity on Planar Graphs. Paderborn.
LibreCat: /record/18955

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).
LibreCat: /record/18575

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.
LibreCat: /record/2175

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

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 
LibreCat: /record/16564
DOI: 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 
LibreCat: /record/16565
DOI: 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 
LibreCat: /record/16567
DOI: 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 
LibreCat: /record/16568
DOI: 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 
LibreCat: /record/16569
DOI: 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 
LibreCat: /record/16604
DOI: 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 
LibreCat: /record/16605
DOI: 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 
LibreCat: /record/16687
DOI: 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 
LibreCat: /record/16689
DOI: 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 
LibreCat: /record/16693
DOI: 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.
LibreCat: /record/19958

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

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.
LibreCat: /record/17419

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.
LibreCat: /record/17483

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 
LibreCat: /record/17564
DOI: 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.
LibreCat: /record/18352

Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.
LibreCat: /record/2181

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 
LibreCat: /record/2182
DOI: 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).
LibreCat: /record/2183

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

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.
LibreCat: /record/2186

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 
LibreCat: /record/16698
DOI: 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 
LibreCat: /record/16699
DOI: 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 
LibreCat: /record/16700
DOI: 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 
LibreCat: /record/16701
DOI: 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 
LibreCat: /record/16702
DOI: 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 
LibreCat: /record/16703
DOI: 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.
LibreCat: /record/19623

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