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: /record/16782
DOI: 10.1109/sfcs.1985.58

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: /record/16783
DOI: 10.1145/22145.22151

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: /record/16784
DOI: 10.1145/22145.22191

Nondeterministic versus probabilistic linear search algorithms
F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.
LibreCat: /record/16788
DOI: 10.1109/sfcs.1985.38

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: /record/16823
DOI: 10.1016/S0019-9958(85)80035-8

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: /record/16785
DOI: 10.1145/828.322450

On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication
F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984.
LibreCat: /record/16786
DOI: 10.1109/sfcs.1984.715901

Efficient simulations among several models of parallel computers (extended abstract)
F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Efficiency of universal parallel computers
F. Meyer auf der Heide, Acta Informatica (1983) 269–296.
LibreCat: /record/16806
DOI: 10.1007/bf00265559

A lower time bound for the knapsack problem on random access machines
P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.
LibreCat: /record/16807
DOI: 10.1007/bf00290735

Infinite cube-connected cycles
F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
LibreCat: /record/16808
DOI: 10.1016/0020-0190(83)90001-7

A polynomial linear search algorithm for the n-dimensional knapsack problem
F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.
LibreCat: /record/16809
DOI: 10.1145/800061.808734

Efficiency of universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.
LibreCat: /record/16810
DOI: 10.1007/bfb0036483

Random access machines and straight-line programs
F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Time-processor trade-offs for universal parallel computers
F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111

A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
LibreCat: /record/16820
DOI: 10.1016/s0304-3975(81)80004-7

Untere Zeitschranken für das Rucksack-Problem
P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
LibreCat: /record/16815
DOI: 10.1007/978-3-642-67838-7_34

A comparison of two variations of a pebble game on graphs
F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979) 411–421.
LibreCat: /record/16812
DOI: 10.1007/3-540-09510-1_32