Image shrinking and expanding on a pyramid
Jing-Fu Jenq, Sartaj K. Sahni · IEEE Transactions on Parallel and Distributed Systems · 1993
Develops two algorithms to perform the q step shrinking and expanding of an N*N binary image on a pyramid computer with an N*N base. The time complexity of both algorithms is O( square root q). However, one uses O( square root q) space per processor, while the per-processor space requirement of the other is O(1).>