Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”10.1007/978-3-642-60831-5_22__Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.
LibreCat: /record/16693
DOI: 10.1007/978-3-642-60831-5_22

Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
LibreCat: /record/19958

Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996.
LibreCat: /record/17418

Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.
LibreCat: /record/17419

Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27.
LibreCat: /record/17483

Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”10.1007/bfb0024725__Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
LibreCat: /record/18352

Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.
LibreCat: /record/2181

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat: /record/2182
DOI: 10.1016/0304-3975(96)00032-1

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat: /record/2183

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
LibreCat: /record/2184

Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat: /record/2186

Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.”10.1007/bf03036467__Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
LibreCat: /record/16698
DOI: 10.1007/bf03036467

Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”10.1007/bf01955042__Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
LibreCat: /record/16699
DOI: 10.1007/bf01955042

Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.”10.1007/bf01940878__Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
LibreCat: /record/16700
DOI: 10.1007/bf01940878

Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.”10.1137/s0097539793255722__SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICAL. 1996, doi:10.1007/3-540-61440-0.
LibreCat: /record/16702
DOI: 10.1007/3-540-61440-0

Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.”10.1007/3-540-60922-9_16__STACS 96, 1996, doi:10.1007/3-540-60922-9_16.
LibreCat: /record/16703
DOI: 10.1007/3-540-60922-9_16

Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19623

Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19627