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


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 | 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: 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
 

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
 

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

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

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

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

1985 | Conference Paper | LibreCat-ID: 16783
One, two, three . . . infinity: lower bounds for parallel computation
F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985.
LibreCat | DOI
 

1985 | Conference Paper | LibreCat-ID: 16784
Fast algorithms for n-dimensional restrictions of hard problems
F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985.
LibreCat | DOI
 

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

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

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

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Export / Embed