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