Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 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.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis