Simon, J., &; Wierum, J.-M. (1998). The Latency-of-Data-Access model for Analyzing Parallel Computation. Information Processing Letters - Special Issue on Models of Computation, 66(5), 255–261.https://doi.org/10.1016/S0020-0190(98)00062-3 

Breslauer, D., Czumaj, A., Dubhashi, D. P., &; Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110.https://doi.org/10.1016/s0020-0190(97)00032-x 

Lautemann, C., &; Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105.https://doi.org/10.1016/0020-0190(85)90042-0 

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