Meyer auf der Heide, Friedhelm, Mirosaw Kutyowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.”https://doi.org/10.1007/3-540-44520-x_59__In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000.https://doi.org/10.1007/3-540-44520-x_59 .
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.”https://doi.org/10.1137/s009753979529564x__SIAM Journal on Computing, 2000, 1703–39.https://doi.org/10.1137/s009753979529564x .
LibreCat: /record/17010
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, 112–16.
LibreCat: /record/16345

Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.”https://doi.org/10.1109/ipps.1999.760442__In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104, 1999.https://doi.org/10.1109/ipps.1999.760442 .
LibreCat: /record/19732
DOI: 10.1109/ipps.1999.760442

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”https://doi.org/10.1007/s002240000123__Theory Comput. Syst. 32, no. 3 (1999): 387--420.https://doi.org/10.1007/s002240000123 .
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
LibreCat: /record/2164

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.
LibreCat: /record/2165

Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver, 1999.
LibreCat: /record/17864

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

Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
LibreCat: /record/18942

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

Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”https://doi.org/10.1145/305619.305637__In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 165–74, 1999.https://doi.org/10.1145/305619.305637 .
LibreCat: /record/18965
DOI: 10.1145/305619.305637

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

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
LibreCat: /record/2210

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

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

Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.”https://doi.org/10.1007/s002240000119__Theory of Computing Systems, 1999, 281–300.https://doi.org/10.1007/s002240000119 .
LibreCat: /record/16502
DOI: 10.1007/s002240000119

Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.”https://doi.org/10.1007/978-3-662-01069-3_47__In Informatik Aktuell. Berlin, Heidelberg, 1999.https://doi.org/10.1007/978-3-662-01069-3_47 .
LibreCat: /record/17052
DOI: 10.1007/978-3-662-01069-3_47

Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”https://doi.org/10.1007/3-540-48481-7_9__In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999.https://doi.org/10.1007/3-540-48481-7_9 .
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

Vöcking, Berthold. Static and Dynamic Data Management in Networks. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
LibreCat: /record/19639

Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.
LibreCat: /record/19735

Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.”https://doi.org/10.1007/3-540-68530-8_14__In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998.https://doi.org/10.1007/3-540-68530-8_14 .
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

Fischer, Matthias, Tamas Lukovszki, and Martin  Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, WAE ’98, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.
LibreCat: /record/17863

Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat: /record/18145

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

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”https://doi.org/10.1007/s002240000096__Theory Comput. Syst. 31, no. 4 (1998): 425--449.https://doi.org/10.1007/s002240000096 .
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
LibreCat: /record/2169

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
LibreCat: /record/2170

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998.https://doi.org/10.1007/BFb0052928 .
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.”https://doi.org/10.1016/s0304-3975(97)86791-6__Theoretical Computer Science 196 (1998): 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, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1016/s0304-3975(98)00020-6__Theoretical Computer Science, 1998, 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, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.”https://doi.org/10.1007/bfb0054332__In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998.https://doi.org/10.1007/bfb0054332 .
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.”https://doi.org/10.1145/276698.276790__In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998.https://doi.org/10.1145/276698.276790 .
LibreCat: /record/16563
DOI: 10.1145/276698.276790

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

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

Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
LibreCat: /record/19637

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

Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.
LibreCat: /record/18955

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

Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.
LibreCat: /record/2175

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
LibreCat: /record/2179

Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.”https://doi.org/10.1007/bf01270387__Computational Complexity, 1997, 357–75.https://doi.org/10.1007/bf01270387 .
LibreCat: /record/16564
DOI: 10.1007/bf01270387

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”https://doi.org/10.1006/inco.1997.2642__Information and Computation, 1997, 103–20.https://doi.org/10.1006/inco.1997.2642 .
LibreCat: /record/16565
DOI: 10.1006/inco.1997.2642

Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.”https://doi.org/10.1007/s002240000071__Theory of Computing Systems, 1997, 627–44.https://doi.org/10.1007/s002240000071 .
LibreCat: /record/16567
DOI: 10.1007/s002240000071

Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.”https://doi.org/10.1007/3-540-63397-9_13__In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997.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, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.”https://doi.org/10.1007/bfb0002716__In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997.https://doi.org/10.1007/bfb0002716 .
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.”https://doi.org/10.1145/258492.258522__In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997.https://doi.org/10.1145/258492.258522 .
LibreCat: /record/16604
DOI: 10.1145/258492.258522

Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.”https://doi.org/10.1007/3-540-63138-0_21__In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997.https://doi.org/10.1007/3-540-63138-0_21 .
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.”https://doi.org/10.1007/bfb0002741__In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997.https://doi.org/10.1007/bfb0002741 .
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”https://doi.org/10.1109/sfcs.1997.646117__In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.https://doi.org/10.1109/sfcs.1997.646117 .
LibreCat: /record/16689
DOI: 10.1109/sfcs.1997.646117

Meyer auf der Heide, Friedhelm, and Thomas Decker. “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, 1997.https://doi.org/10.1007/978-3-642-60831-5_22 .
LibreCat: /record/16693
DOI: 10.1007/978-3-642-60831-5_22

Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I (1996): 299–306.
LibreCat: /record/19958

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB, University of Paderborn, 1996.
LibreCat: /record/17418

Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.
LibreCat: /record/17419

Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “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), 13–27. Amsterdam: IOS Press, 1996.
LibreCat: /record/17483

Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.”https://doi.org/10.1007/bfb0024725__In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996.https://doi.org/10.1007/bfb0024725 .
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 1996.
LibreCat: /record/18352

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

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”https://doi.org/10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2 (1996): 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, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.
LibreCat: /record/2183

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

Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.
LibreCat: /record/2186

Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.”https://doi.org/10.1007/bf03036467__Acta Informatica, 1996, 621–30.https://doi.org/10.1007/bf03036467 .
LibreCat: /record/16698
DOI: 10.1007/bf03036467

Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.”https://doi.org/10.1007/bf01955042__Algorithmica, 1996, 413–27.https://doi.org/10.1007/bf01955042 .
LibreCat: /record/16699
DOI: 10.1007/bf01955042

Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.”https://doi.org/10.1007/bf01940878__Algorithmica, 1996, 517–42.https://doi.org/10.1007/bf01940878 .
LibreCat: /record/16700
DOI: 10.1007/bf01940878

Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.”https://doi.org/10.1137/s0097539793255722__SIAM Journal on Computing, 1996, 936–55.https://doi.org/10.1137/s0097539793255722 .
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

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

Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.”https://doi.org/10.1007/3-540-60922-9_16__In STACS 96. Berlin, Heidelberg, 1996.https://doi.org/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. Vol. 3. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19623

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

Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Vol. 6. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19630

Ameur, Foued. Space-Bounded Learning Algorithms. Vol. 10. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
LibreCat: /record/19634

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 46--59, 1995.
LibreCat: /record/17482

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”https://doi.org/10.1007/3-540-60313-1_154__In ESA, 341--354. Lecture Notes in Computer Science, 1995.https://doi.org/10.1007/3-540-60313-1_154 .
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.
LibreCat: /record/2207

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.
LibreCat: /record/2208

Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”https://doi.org/10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, 103–10.https://doi.org/10.1016/s0020-0190(97)00032-x .
LibreCat: /record/16566
DOI: 10.1016/s0020-0190(97)00032-x

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.”https://doi.org/10.1007/3-540-59042-0_81__In STACS 95. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-59042-0_81 .
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.”https://doi.org/10.1007/3-540-60313-1_133__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_133 .
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.”https://doi.org/10.1145/215399.215430__In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.https://doi.org/10.1145/215399.215430 .
LibreCat: /record/16706
DOI: 10.1145/215399.215430

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.”https://doi.org/10.1109/istcs.1995.377051__In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.https://doi.org/10.1109/istcs.1995.377051 .
LibreCat: /record/16707
DOI: 10.1109/istcs.1995.377051

Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.”https://doi.org/10.1007/3-540-60618-1_77__In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60618-1_77 .
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1007/3-540-60313-1_131__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_131 .
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität Paderborn, 1994.
LibreCat: /record/19624

Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.”https://doi.org/10.1137/s0097539791194094__SIAM Journal on Computing, 1994, 738–61.https://doi.org/10.1137/s0097539791194094 .
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.https://doi.org/10.1007/3-540-56731-3 .
LibreCat: /record/17477
DOI: 10.1007/3-540-56731-3

Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” In Proc. 3rd PASA Workshop, PARS Mitteilungen, 50–55, 1993.
LibreCat: /record/17479

Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.”https://doi.org/10.1006/inco.1993.1007__Information and Computation, 1993, 196–217.https://doi.org/10.1006/inco.1993.1007 .
LibreCat: /record/16729
DOI: 10.1006/inco.1993.1007

Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.”https://doi.org/10.1007/3-540-56939-1_89__In Automata, Languages and Programming. Berlin, Heidelberg, 1993.https://doi.org/10.1007/3-540-56939-1_89 .
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.”https://doi.org/10.1145/165231.165246__In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993.https://doi.org/10.1145/165231.165246 .
LibreCat: /record/16731
DOI: 10.1145/165231.165246

Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.”https://doi.org/10.1007/3-540-56503-5_46__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993.https://doi.org/10.1007/3-540-56503-5_46 .
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.”https://doi.org/10.1142/s0129626492000349__Parallel Processing Letters 2, 1992, 213–20.https://doi.org/10.1142/s0129626492000349 .
LibreCat: /record/18936
DOI: 10.1142/s0129626492000349

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.”https://doi.org/10.1007/3-540-55488-2_31__In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55488-2_31 .
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.”https://doi.org/10.1007/3-540-56731-3_3__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-56731-3_3 .
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.”https://doi.org/10.1007/3-540-55210-3_176__In STACS 92. Berlin, Heidelberg, 1992.https://doi.org/10.1007/3-540-55210-3_176 .
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.”https://doi.org/10.1145/129712.129743__In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.https://doi.org/10.1145/129712.129743 .
LibreCat: /record/16736
DOI: 10.1145/129712.129743

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.”https://doi.org/10.1007/978-3-322-95233-2_7__In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992.https://doi.org/10.1007/978-3-322-95233-2_7 .
LibreCat: /record/16737
DOI: 10.1007/978-3-322-95233-2_7

Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.”https://doi.org/10.1007/bfb0032068__In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990.https://doi.org/10.1007/bfb0032068 .
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.”https://doi.org/10.1007/bfb0032018__In Automata, Languages and Programming. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0032018 .
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.”https://doi.org/10.1007/bfb0029597__In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990.https://doi.org/10.1007/bfb0029597 .
LibreCat: /record/16739
DOI: 10.1007/bfb0029597