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

Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, pp. 103–10, 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.”10.1016/0020-0190(85)90042-0__Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.

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