Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.”https://doi.org/10.1007/3-540-16761-7_54__In Automata, Languages and Programming. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16761-7_54 .
LibreCat: /record/16774
DOI: 10.1007/3-540-16761-7_54

Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.”https://doi.org/10.1007/3-540-16078-7_72__In STACS 86. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16078-7_72 .
LibreCat: /record/16775
DOI: 10.1007/3-540-16078-7_72

Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.”https://doi.org/10.1007/3-540-16078-7_89__In STACS 86. Berlin, Heidelberg, 1986.https://doi.org/10.1007/3-540-16078-7_89 .
LibreCat: /record/16776
DOI: 10.1007/3-540-16078-7_89

Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).”https://doi.org/10.1007/3-540-12920-0_20__In STACS 84. Berlin, Heidelberg, 1984.https://doi.org/10.1007/3-540-12920-0_20 .
LibreCat: /record/16787
DOI: 10.1007/3-540-12920-0_20

Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.”https://doi.org/10.1007/3-540-10854-8_29__In Fundamentals of Computation Theory. Berlin, Heidelberg, 1981.https://doi.org/10.1007/3-540-10854-8_29 .
LibreCat: /record/16813
DOI: 10.1007/3-540-10854-8_29

Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.”https://doi.org/10.1007/3-540-10856-4_111__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1981.https://doi.org/10.1007/3-540-10856-4_111 .
LibreCat: /record/16814
DOI: 10.1007/3-540-10856-4_111