Czumaj, A., &; Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.
LibreCat: /record/2150

Wand, M., Fischer, M., &; Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn.
LibreCat: /record/17865

Govindarajan, S., Lukovszki, T., Maheshwari, A., &; Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614).https://doi.org/10.1007/s00453-005-1197-3 
LibreCat: /record/18962
DOI: 10.1007/s00453-005-1197-3

Czumaj, A., Sohler, C., &; Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-45253-2_15 
LibreCat: /record/17990
DOI: 10.1007/3-540-45253-2_15

Ziegler, M., &; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer.https://doi.org/10.1007/3-540-44411-4_34 
LibreCat: /record/18146
DOI: 10.1007/3-540-44411-4_34

Ziegler, M., &; Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 73–79).
LibreCat: /record/18150

Lorys, K., Wanka, R., Oesterdiekhoff, B., &; Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967.https://doi.org/10.1145/355483.355490 
LibreCat: /record/18446
DOI: 10.1145/355483.355490

Czumaj, A., &; Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).
LibreCat: /record/2211

Meyer auf der Heide, F., Räcke, H., &; Westermann, M. (2000). Data management in hierarchical bus networks. Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00.https://doi.org/10.1145/341800.341814 
LibreCat: /record/16495
DOI: 10.1145/341800.341814

Meyer auf der Heide, F., Vöcking, B., &; Westermann, M. (2000). Caching in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).
LibreCat: /record/16496

Meyer auf der Heide, F., Kutyowski, M., &; Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg.https://doi.org/10.1007/3-540-44520-x_59 
LibreCat: /record/16497
DOI: 10.1007/3-540-44520-x_59

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739.https://doi.org/10.1137/s009753979529564x 
LibreCat: /record/17010
DOI: 10.1137/s009753979529564x

Meyer auf der Heide, F., &; Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn, 112–116.
LibreCat: /record/16345

Bonorden, O., Juurlink, B., Von Otte, I., &; Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104.https://doi.org/10.1109/ipps.1999.760442 
LibreCat: /record/19732
DOI: 10.1109/ipps.1999.760442

Flammini, M., &; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.https://doi.org/10.1007/s002240000123 
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, P., &; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
LibreCat: /record/2164

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).
LibreCat: /record/2165

Fischer, M., Lukovszki, T., &; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver.
LibreCat: /record/17864

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

Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/18942

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

Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &; Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99 (pp. 165–174).https://doi.org/10.1145/305619.305637 
LibreCat: /record/18965
DOI: 10.1145/305619.305637

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

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat: /record/2210

Scheideler, C., &; Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).
LibreCat: /record/2166

Meyer auf der Heide, F., &; Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131.https://doi.org/10.1006/jagm.1998.0980 
LibreCat: /record/16501
DOI: 10.1006/jagm.1998.0980

Berenbrink, P., Meyer auf der Heide, F., &; Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300.https://doi.org/10.1007/s002240000119 
LibreCat: /record/16502
DOI: 10.1007/s002240000119

Mayr, E. W., Meyer auf der Heide, F., &; Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell.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, F., Vöcking, B., &; Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg.https://doi.org/10.1007/3-540-48481-7_9 
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

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

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

Wachsmann, A. (1995). Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher (Vol. 6). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat: /record/19630

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

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1995). Simulating shared memory in real time: On the computation power of reconfigurable meshes. In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures (pp. 46--59).
LibreCat: /record/17482

Meyer auf der Heide, F., &; Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354).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, F., &; Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
LibreCat: /record/2207

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).
LibreCat: /record/2208

Breslauer, D., Czumaj, A., Dubhashi, D. P., &; Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110.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, F., &; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg.https://doi.org/10.1007/3-540-59042-0_81 
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg.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, F., Storch, M., &; Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95.https://doi.org/10.1145/215399.215430 
LibreCat: /record/16706
DOI: 10.1145/215399.215430

Czumaj, A., Meyer auf der Heide, F., &; Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. Proceedings Third Israel Symposium on the Theory of Computing and Systems.https://doi.org/10.1109/istcs.1995.377051 
LibreCat: /record/16707
DOI: 10.1109/istcs.1995.377051

Meyer auf der Heide, F., &; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60618-1_77 
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, A., Dittrich, W., &; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/3-540-60313-1_131 
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Wanka, R. (1994). Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn.
LibreCat: /record/19624

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &; Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761.https://doi.org/10.1137/s0097539791194094 
LibreCat: /record/16728
DOI: 10.1137/s0097539791194094

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

Kastens, U., Meyer auf der Heide, F., Wachsmann, A., &; Wichmann, F. (1993). OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In Proc. 3rd PASA Workshop, PARS Mitteilungen (pp. 50–55).
LibreCat: /record/17479

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217.https://doi.org/10.1006/inco.1993.1007 
LibreCat: /record/16729
DOI: 10.1006/inco.1993.1007

Meyer auf der Heide, F., Oesterdiekhoff, B., &; Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/3-540-56939-1_89 
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Dietzfelbinger, M., &; Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93.https://doi.org/10.1145/165231.165246 
LibreCat: /record/16731
DOI: 10.1145/165231.165246