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

Data management in networks: experimental evaluation of a provably good strategy
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–174.
LibreCat: /record/18965
DOI: 10.1145/305619.305637

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

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

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

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

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

International Workshop on Communication and Data Management in Large Networks
E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.
LibreCat: /record/17052
DOI: 10.1007/978-3-662-01069-3_47

Provably Good and Practical Strategies for Non-uniform Data Management in Networks
F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat: /record/17053
DOI: 10.1007/3-540-48481-7_9

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

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

Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.
LibreCat: /record/17412
DOI: 10.1007/3-540-68530-8_14

A Network Based Approach for Realtime Walkthrough of Massive Models
M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, WAE ’98, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.
LibreCat: /record/17863

Multimediale Entdeckungsreisen unserer Welt mit dem Internet
M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
LibreCat: /record/18145

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

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

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

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

Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.
LibreCat: /record/2185
DOI: 10.1007/BFb0052928

Routing on networks of optical crossbars
F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.
LibreCat: /record/16503
DOI: 10.1016/s0304-3975(97)86791-6

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.
LibreCat: /record/16504
DOI: 10.1016/s0304-3975(98)00020-6

Communication-efficient parallel multiway and approximate minimum cut computation
F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.
LibreCat: /record/16562
DOI: 10.1007/bfb0054332

Randomized protocols for low-congestion circuit routing in multistage interconnection networks
R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998.
LibreCat: /record/16563
DOI: 10.1145/276698.276790

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

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

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

Bounded degree spanning trees
A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.
LibreCat: /record/19869
DOI: 10.1007/3-540-63397-9_9

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

Encoding a Triangulation as a Permutation of its Point Set
C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.
LibreCat: /record/18575

Optimal Wormhole Routing in the (n, d)-Torus
S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat: /record/2175

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

A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.
LibreCat: /record/16564
DOI: 10.1007/bf01270387

Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.
LibreCat: /record/16565
DOI: 10.1006/inco.1997.2642

Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.
LibreCat: /record/16567
DOI: 10.1007/s002240000071

Dynamic data structures for realtime management of large geometric scenes
M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.
LibreCat: /record/16568
DOI: 10.1007/3-540-63397-9_13

Static and dynamic data management in networks
F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16569
DOI: 10.1007/bfb0002716

Allocating weighted jobs in parallel
P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997.
LibreCat: /record/16604
DOI: 10.1145/258492.258522

Communication efficient parallel searching
A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.
LibreCat: /record/16605
DOI: 10.1007/3-540-63138-0_21

Routing on asyncronous processor networks
E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
LibreCat: /record/16687
DOI: 10.1007/bfb0002741

Exploiting locality for data management in systems of limited bandwidth
B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.
LibreCat: /record/16689
DOI: 10.1109/sfcs.1997.646117

Parallel Computing in Paderborn: The SFB 376 cMassive Parallelism 4 Algorithms, Design Methods, Applicationsd
F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.
LibreCat: /record/16693
DOI: 10.1007/978-3-642-60831-5_22

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

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

A lower bound for randomized algebraic decision trees
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.
LibreCat: /record/17419

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

Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model
A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.
LibreCat: /record/17564
DOI: 10.1007/bfb0024725

A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware
M. Fischer, J. Rethmann, A. 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

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

Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.
LibreCat: /record/2182
DOI: 10.1016/0304-3975(96)00032-1

Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols
F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.
LibreCat: /record/2183

Communication in Parallel Systems
F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.
LibreCat: /record/2184

Universal Algorithms for Store-and-Forward and Wormhole Routing
R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.
LibreCat: /record/2186

Trial and error. A new approach to space-bounded learning
F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.
LibreCat: /record/16698
DOI: 10.1007/bf03036467

Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.
LibreCat: /record/16699
DOI: 10.1007/bf01955042

Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
LibreCat: /record/16700
DOI: 10.1007/bf01940878

The Tree Model for Hashing: Lower and Upper Bounds
J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.
LibreCat: /record/16701
DOI: 10.1137/s0097539793255722

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

Fault-tolerant shared memory simulations
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
LibreCat: /record/16703
DOI: 10.1007/3-540-60922-9_16

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

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

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

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

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

Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.
LibreCat: /record/2207

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

Transforming comparison model lower bounds to the parallel-random-access-machine
D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.
LibreCat: /record/16566
DOI: 10.1016/s0020-0190(97)00032-x

A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Shared memory simulations with triple-logarithmic delay
A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Optimal trade-offs between size and slowdown for universal parallel networks
F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.
LibreCat: /record/16706
DOI: 10.1145/215399.215430

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

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

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

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

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

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

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

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

Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat: /record/16730
DOI: 10.1007/3-540-56939-1_89

Simple, efficient shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993.
LibreCat: /record/16731
DOI: 10.1145/165231.165246

Capabilities and complexity of computations with integer division
K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat: /record/16732
DOI: 10.1007/3-540-56503-5_46

Periodic Sorting on Two-Dimensional Meshes
M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.
LibreCat: /record/18936
DOI: 10.1142/s0129626492000349

High performance universal hashing, with applications to shared memory simulations
M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.
LibreCat: /record/16733
DOI: 10.1007/3-540-55488-2_31

Hashing strategies for simulating shared memory on distributed memory machines
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat: /record/16734
DOI: 10.1007/3-540-56731-3_3

On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat: /record/16735
DOI: 10.1007/3-540-55210-3_176

Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.
LibreCat: /record/16736
DOI: 10.1145/129712.129743

Dynamic Hashing in Real Time
M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.
LibreCat: /record/16737
DOI: 10.1007/978-3-322-95233-2_7

Approximation of convex polygons
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

A new universal class of hash functions and dynamic hashing in real time
M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.
LibreCat: /record/16738
DOI: 10.1007/bfb0032018

Dynamic hashing strategies
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat: /record/16739
DOI: 10.1007/bfb0029597

On the complexity of genuinely polynomial computation
M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat: /record/16740
DOI: 10.1007/bfb0029630

How to distribute a dictionary in a complete network
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.
LibreCat: /record/16741
DOI: 10.1145/100216.100229

Not all keys can be hashed in constant time
J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.
LibreCat: /record/16742
DOI: 10.1145/100216.100247

Das Heinz Nixdorf-Institut der Universität-GH Paderborn
F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232.
LibreCat: /record/16824

On computations with integer division
B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.
LibreCat: /record/16743
DOI: 10.1051/ita/1989230101011

An optimal parallel dictionary
M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989.
LibreCat: /record/16744
DOI: 10.1145/72935.72974

On genuinely time bounded computations
F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat: /record/16745
DOI: 10.1007/bfb0028969

Time-optimal simulations of networks by universal parallel computers
F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat: /record/16746
DOI: 10.1007/bfb0028978

Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat: /record/16789
DOI: 10.1007/bfb0028983

On the limits of computations with the floor function
L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.
LibreCat: /record/16763
DOI: 10.1016/0890-5401(88)90031-4