@inproceedings{16782,
  author       = {{Meyer auf der Heide, Friedhelm and Wigderson, Avi}},
  booktitle    = {{26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}},
  isbn         = {{0818606444}},
  title        = {{{The complexity of parallel sorting}}},
  doi          = {{10.1109/sfcs.1985.58}},
  year         = {{1985}},
}

@inproceedings{16783,
  author       = {{Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P and Wigderson, A}},
  booktitle    = {{Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85}},
  isbn         = {{0897911512}},
  title        = {{{One, two, three . . . infinity: lower bounds for parallel computation}}},
  doi          = {{10.1145/22145.22151}},
  year         = {{1985}},
}

@inproceedings{16784,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85}},
  isbn         = {{0897911512}},
  title        = {{{Fast algorithms for n-dimensional restrictions of hard problems}}},
  doi          = {{10.1145/22145.22191}},
  year         = {{1985}},
}

@inproceedings{16788,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}},
  isbn         = {{0818606444}},
  title        = {{{Nondeterministic versus probabilistic linear search algorithms}}},
  doi          = {{10.1109/sfcs.1985.38}},
  year         = {{1985}},
}

@article{16823,
  author       = {{Meyer auf der Heide, Friedhelm}},
  journal      = {{Information and Control}},
  number       = {{1-3}},
  pages        = {{195--211}},
  title        = {{{Lower time bounds for solving linear diophantine equations on several parallel computational models}}},
  doi          = {{10.1016/S0019-9958(85)80035-8}},
  volume       = {{67}},
  year         = {{1985}},
}

@article{16785,
  author       = {{Meyer auf der Heide, Friedhelm}},
  issn         = {{0004-5411}},
  journal      = {{Journal of the ACM (JACM)}},
  pages        = {{668--676}},
  title        = {{{A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}}},
  doi          = {{10.1145/828.322450}},
  year         = {{1984}},
}

@inproceedings{16786,
  author       = {{Meyer auf der Heide, Friedhelm and Reischuk, R.}},
  booktitle    = {{25th Annual Symposium onFoundations of Computer Science, 1984.}},
  isbn         = {{081860591X}},
  title        = {{{On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication}}},
  doi          = {{10.1109/sfcs.1984.715901}},
  year         = {{1984}},
}

@inbook{16787,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{STACS 84}},
  isbn         = {{9783540129202}},
  issn         = {{0302-9743}},
  title        = {{{Efficient simulations among several models of parallel computers (extended abstract)}}},
  doi          = {{10.1007/3-540-12920-0_20}},
  year         = {{1984}},
}

@article{16806,
  author       = {{Meyer auf der Heide, Friedhelm}},
  issn         = {{0001-5903}},
  journal      = {{Acta Informatica}},
  pages        = {{269--296}},
  title        = {{{Efficiency of universal parallel computers}}},
  doi          = {{10.1007/bf00265559}},
  year         = {{1983}},
}

@article{16807,
  author       = {{Klein, Peter and Meyer auf der Heide, Friedhelm}},
  issn         = {{0001-5903}},
  journal      = {{Acta Informatica}},
  pages        = {{385--395}},
  title        = {{{A lower time bound for the knapsack problem on random access machines}}},
  doi          = {{10.1007/bf00290735}},
  year         = {{1983}},
}

@article{16808,
  author       = {{Meyer auf der Heide, Friedhelm}},
  issn         = {{0020-0190}},
  journal      = {{Information Processing Letters}},
  pages        = {{1--2}},
  title        = {{{Infinite cube-connected cycles}}},
  doi          = {{10.1016/0020-0190(83)90001-7}},
  year         = {{1983}},
}

@inproceedings{16809,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC '83}},
  isbn         = {{0897910990}},
  title        = {{{A polynomial linear search algorithm for the n-dimensional knapsack problem}}},
  doi          = {{10.1145/800061.808734}},
  year         = {{1983}},
}

@inbook{16810,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{3540119736}},
  title        = {{{Efficiency of universal parallel computers}}},
  doi          = {{10.1007/bfb0036483}},
  year         = {{1983}},
}

@inbook{16813,
  author       = {{Meyer auf der Heide, Friedhelm and Rollik, Anton}},
  booktitle    = {{Fundamentals of Computation Theory}},
  isbn         = {{9783540108542}},
  issn         = {{0302-9743}},
  title        = {{{Random access machines and straight-line programs}}},
  doi          = {{10.1007/3-540-10854-8_29}},
  year         = {{1981}},
}

@inbook{16814,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540108566}},
  issn         = {{0302-9743}},
  title        = {{{Time-processor trade-offs for universal parallel computers}}},
  doi          = {{10.1007/3-540-10856-4_111}},
  year         = {{1981}},
}

@article{16820,
  author       = {{Meyer auf der Heide, Friedhelm}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  pages        = {{315--322}},
  title        = {{{A comparison of two variations of a pebble game on graphs}}},
  doi          = {{10.1016/s0304-3975(81)80004-7}},
  year         = {{1981}},
}

@inbook{16815,
  author       = {{Klein, P. and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{GI - 10. Jahrestagung}},
  isbn         = {{9783540103882}},
  issn         = {{0343-3005}},
  title        = {{{Untere Zeitschranken für das Rucksack-Problem}}},
  doi          = {{10.1007/978-3-642-67838-7_34}},
  year         = {{1980}},
}

@article{16812,
  author       = {{Meyer auf der Heide, Friedhelm}},
  journal      = {{Automata, Languages and Programming. ICALP 1979}},
  pages        = {{411--421}},
  title        = {{{A comparison of two variations of a pebble game on graphs}}},
  doi          = {{10.1007/3-540-09510-1_32 }},
  year         = {{1979}},
}

