Fast algorithms for N-dimensional restrictions of hard problems - Meyer auf der Heide, Friedhelm (Journal of the ACM (JACM))

A tradeoff between search and update time for the implicit dictionary problem - Borodin, Allan; Fich, Faith E.; Meyer auf der Heide, Friedhelm; Upfal, Eli; Wigderson, Avi (Theoretical Computer Science)

Dynamic perfect hashing: upper and lower bounds - Dietzfelbinger, M.; Karlin, A.; Mehlhorn, K.; Meyer auf der Heide, Friedhelm; Rohnert, H.; Tarjan, R.E. ([Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science)

On computations with integer division - Just, Bettina; Mathematik, Fb; Meyer auf der Heide, Friedhelm; Informatik, Fb; Wigderson, Avi (STACS 88)

Upper and lower bounds for the dictionary problem - Dietzfelbinger, M.; Mehlhorn, K.; Meyer auf der Heide, Friedhelm; Rohnert, H. (SWAT 88)

A Time-Space Tradeoff for Element Distinctness - Borodin, A.; Fich, F.; Meyer auf der Heide, Friedhelm; Upfal, E.; Wigderson, A. (SIAM Journal on Computing)

The Complexity of Parallel Sorting - Meyer auf der Heide, Friedhelm; Wigderson, Avi (SIAM Journal on Computing)

Efficient Simulations among Several Models of Parallel Computers - Meyer auf der Heide, Friedhelm (SIAM Journal on Computing)

A tradeoff between search and update time for the implicit dictionary problem - Borodin, Allan; Fich, Faith E.; Meyer auf der Heide, Friedhelm; Upfal, Eli; Wigderson, Avi (Automata, Languages and Programming)

Speeding up random access machines by few processors - Meyer auf der Heide, Friedhelm (STACS 86)

A time-space tradeoff for element distinctness - Borodin, A.; Fich, F.; Meyer auf der Heide, Friedhelm; Upfal, E.; Wigderson, A. (STACS 86)

Lower time bounds for integer programming with two variables - Lautemann, Clemens; Meyer auf der Heide, Friedhelm (Information Processing Letters)

Lower bounds for solving linear diophantine equations on random access machines - Meyer auf der Heide, Friedhelm (Journal of the ACM (JACM))

Simulating probabilistic by deterministic algebraic computation trees - Meyer auf der Heide, Friedhelm (Theoretical Computer Science)

The complexity of parallel sorting - Meyer auf der Heide, Friedhelm; Wigderson, Avi (26th Annual Symposium on Foundations of Computer Science (sfcs 1985))

One, two, three . . . infinity: lower bounds for parallel computation - Fich, F E; Meyer auf der Heide, Friedhelm; Ragde, P; Wigderson, A (Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85)

Fast algorithms for n-dimensional restrictions of hard problems - Meyer auf der Heide, Friedhelm (Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85)

Nondeterministic versus probabilistic linear search algorithms - Meyer auf der Heide, Friedhelm (26th Annual Symposium on Foundations of Computer Science (sfcs 1985))

Lower time bounds for solving linear diophantine equations on several parallel computational models - Meyer auf der Heide, Friedhelm (Information and Control)

A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem - Meyer auf der Heide, Friedhelm (Journal of the ACM (JACM))