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.

264 Publications


1996 | Book (Editor) | LibreCat-ID: 16702
F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996.
LibreCat | DOI
 

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

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

1995 | Book Chapter | LibreCat-ID: 16705
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16717
F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1995 | Book Chapter | LibreCat-ID: 16874
A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.
LibreCat | DOI
 

1993 | Book (Editor) | LibreCat-ID: 17477
F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
LibreCat | DOI
 

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

1993 | Book Chapter | LibreCat-ID: 16732
K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 3046
H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16733
M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in Data structures and efficient algorithms, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 16734
F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.
LibreCat | DOI
 

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

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

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

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

1987 | Book Chapter | LibreCat-ID: 19821
H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in Computation Theory and Logic, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.
LibreCat | DOI
 

1986 | Book Chapter | LibreCat-ID: 19819
H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.
LibreCat | DOI
 

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

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

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

1984 | Book Chapter | LibreCat-ID: 16787
F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.
LibreCat | DOI
 

1981 | Book Chapter | LibreCat-ID: 16813
F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat | DOI
 

1981 | Book Chapter | LibreCat-ID: 16814
F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed