Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

361 Publications


1996 | Conference Paper | LibreCat-ID: 17419
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
 

1996 | Book Chapter | LibreCat-ID: 16703
Fault-tolerant shared memory simulations
P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16700
Efficient PRAM simulation on a distributed memory machine
R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
LibreCat | DOI
 

1996 | Journal Article | LibreCat-ID: 16698
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 | DOI
 

1996 | Journal Article | LibreCat-ID: 16701
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 | DOI
 

1996 | Report | LibreCat-ID: 17418
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
 

1996 | Book Chapter | LibreCat-ID: 17564
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 | DOI
 

1995 | Conference Paper | LibreCat-ID: 16707
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 | DOI
 

1995 | Book Chapter | LibreCat-ID: 16704
A packet routing protocol for arbitrary networks
F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
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 | DOI
 

1995 | Book Chapter | LibreCat-ID: 16705
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 | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
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 | DOI
 

1995 | Conference Paper | LibreCat-ID: 16706
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 | DOI
 

1995 | Conference Paper | LibreCat-ID: 17482
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
 

1995 | Journal Article | LibreCat-ID: 16566
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 | DOI
 

1994 | Journal Article | LibreCat-ID: 16728
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 | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
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 | DOI
 

1993 | Book Chapter | LibreCat-ID: 16730
Strongly adaptive token distribution
F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 16731
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 | DOI
 

1993 | Journal Article | LibreCat-ID: 16729
An Optimal Parallel Dictionary
M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217.
LibreCat | DOI
 

1993 | Conference Paper | LibreCat-ID: 17479
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
 

1993 | Book Chapter | LibreCat-ID: 16732
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16735
On the performance of networks with multiple busses
F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 16736
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 | DOI
 

1992 | Book Chapter | LibreCat-ID: 16737
Dynamic Hashing in Real Time
M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16738
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 | DOI
 

1990 | Book Chapter | LibreCat-ID: 16740
On the complexity of genuinely polynomial computation
M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16739
Dynamic hashing strategies
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16741
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 | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
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 | DOI
 

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

1989 | Book Chapter | LibreCat-ID: 16745
On genuinely time bounded computations
F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.
LibreCat | DOI
 

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

1989 | Book Chapter | LibreCat-ID: 16789
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.
LibreCat | DOI
 

1989 | Journal Article | LibreCat-ID: 16743
On computations with integer division
B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.
LibreCat | DOI
 

1989 | Conference Paper | LibreCat-ID: 16744
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 | DOI
 

1988 | Journal Article | LibreCat-ID: 16764
Fast algorithms for N-dimensional restrictions of hard problems
F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16765
A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.
LibreCat | DOI
 

1988 | Conference Paper | LibreCat-ID: 16766
Dynamic perfect hashing: upper and lower bounds
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
LibreCat | DOI
 

1988 | Book Chapter | LibreCat-ID: 16767
On computations with integer division
B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.
LibreCat | DOI
 

1988 | Journal Article | LibreCat-ID: 16763
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 | DOI
 

1988 | Book Chapter | LibreCat-ID: 16768
Upper and lower bounds for the dictionary problem
M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16772
A Time-Space Tradeoff for Element Distinctness
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 97–99.
LibreCat | DOI
 

1987 | Journal Article | LibreCat-ID: 16773
The Complexity of Parallel Sorting
F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.
LibreCat | DOI
 

1986 | Journal Article | LibreCat-ID: 16771
Efficient Simulations among Several Models of Parallel Computers
F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16776
A time-space tradeoff for element distinctness
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16774
A tradeoff between search and update time for the implicit dictionary problem
A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 16775
Speeding up random access machines by few processors
F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed