Simon, Jens, and Jens-Michael Wierum. “The Latency-of-Data-Access Model for Analyzing Parallel Computation.”https://doi.org/10.1016/S0020-0190(98)00062-3__Information Processing Letters - Special Issue on Models of Computation 66, no. 5 (1998): 255–61.https://doi.org/10.1016/S0020-0190(98)00062-3 .
LibreCat: /record/2437
DOI: 10.1016/S0020-0190(98)00062-3

Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”https://doi.org/10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, 103–10.https://doi.org/10.1016/s0020-0190(97)00032-x .
LibreCat: /record/16566
DOI: 10.1016/s0020-0190(97)00032-x

Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.”https://doi.org/10.1016/0020-0190(85)90042-0__Information Processing Letters, 1985, 101–5.https://doi.org/10.1016/0020-0190(85)90042-0 .
LibreCat: /record/16779
DOI: 10.1016/0020-0190(85)90042-0

Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.”https://doi.org/10.1016/0020-0190(83)90001-7__Information Processing Letters, 1983, 1–2.https://doi.org/10.1016/0020-0190(83)90001-7 .
LibreCat: /record/16808
DOI: 10.1016/0020-0190(83)90001-7