Conference paper
Isotropic treatment of EMF effects in advanced photomasks
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
We consider the problem of computing the median of a bag of 2n numbers by using communicating processes, each having some of the numbers in its local memory. The memories are assumed to be disjoint. For two processes an algorithm is given. Its time and space complexity is linear while the communication complexity is 2 log2 n. A lower bound of log2 n on the communication complexity is derived. Thus the algorithm is optimal up to a constant. © 1982.
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009
George Markowsky
J. Math. Anal. Appl.
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
Andrew Skumanich
SPIE Optics Quebec 1993