Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
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.
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
T. Graham, A. Afzali, et al.
Microlithography 2000
Y.Y. Li, K.S. Leung, et al.
J Combin Optim