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.

792 Publications


1995 | Conference Paper | LibreCat-ID: 16707
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.
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
 

1994 | Dissertation | LibreCat-ID: 19624
R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn, 1994.
LibreCat | Files available
 

1994 | Journal Article | LibreCat-ID: 16728
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.
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 | Conference Paper | LibreCat-ID: 17479
U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.
LibreCat
 

1993 | Journal Article | LibreCat-ID: 16729
M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” Information and Computation, pp. 196–217, 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 | Conference Paper | LibreCat-ID: 16731
M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93, 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 | Journal Article | LibreCat-ID: 18936
M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” Parallel Processing Letters 2, pp. 213–220, 1992, doi: 10.1142/s0129626492000349.
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
 

1992 | Conference Paper | LibreCat-ID: 16736
R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92, 1992.
LibreCat | DOI
 

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

1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 16738
M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990.
LibreCat | DOI
 

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

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

1990 | Conference Paper | LibreCat-ID: 16741
M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary in a complete network,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90, 1990.
LibreCat | DOI
 

1990 | Conference Paper | LibreCat-ID: 16742
J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed in constant time,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90, 1990.
LibreCat | DOI
 

1990 | Journal Article | LibreCat-ID: 16824
F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,” Informatik Spektrum, vol. 13, no. 4, pp. 231–232, 1990.
LibreCat
 

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

1989 | Conference Paper | LibreCat-ID: 16744
M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,” in Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89, 1989.
LibreCat | DOI
 

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

1989 | Book Chapter | LibreCat-ID: 16746
F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in STACS 89, Berlin/Heidelberg, 1989.
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 | Journal Article | LibreCat-ID: 16763
L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” Information and Computation, pp. 99–107, 1988.
LibreCat | DOI
 

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

1988 | Journal Article | LibreCat-ID: 16765
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,” Theoretical Computer Science, pp. 57–68, 1988.
LibreCat | DOI
 

1988 | Conference Paper | LibreCat-ID: 16766
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
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 | Journal Article | LibreCat-ID: 16772
A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A Time-Space Tradeoff for Element Distinctness,” SIAM Journal on Computing, pp. 97–99, 1987.
LibreCat | DOI
 

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

1986 | Journal Article | LibreCat-ID: 16771
F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 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
 

1985 | Journal Article | LibreCat-ID: 16779
C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16780
F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16781
F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16782
F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16783
F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two, three . . . infinity: lower bounds for parallel computation,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16784
F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC ’85, 1985.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16788
F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.
LibreCat | DOI
 

1985 | Journal Article | LibreCat-ID: 16823
F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine equations on several parallel computational models,” Information and Control, vol. 67, no. 1–3, pp. 195–211, 1985.
LibreCat | DOI
 

1984 | Journal Article | LibreCat-ID: 16785
F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem,” Journal of the ACM (JACM), pp. 668–676, 1984.
LibreCat | DOI
 

1984 | Conference Paper | LibreCat-ID: 16786
F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication,” in 25th Annual Symposium onFoundations of Computer Science, 1984., 1984.
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
 

1983 | Journal Article | LibreCat-ID: 16806
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983.
LibreCat | DOI
 

1983 | Journal Article | LibreCat-ID: 16807
P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” Acta Informatica, pp. 385–395, 1983.
LibreCat | DOI
 

1983 | Journal Article | LibreCat-ID: 16808
F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing Letters, pp. 1–2, 1983.
LibreCat | DOI
 

1983 | Conference Paper | LibreCat-ID: 16809
F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83, 1983.
LibreCat | DOI
 

1983 | Book Chapter | LibreCat-ID: 16810
F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.
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
 

1981 | Journal Article | LibreCat-ID: 16820
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.
LibreCat | DOI
 

1980 | Book Chapter | LibreCat-ID: 16815
P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
LibreCat | DOI
 

1979 | Journal Article | LibreCat-ID: 16812
F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421, 1979.
LibreCat | DOI
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed