Shout echo selection in distributed files

An algorithm for selecting the kth smallest element of a distributed file using shout-echo communication primitives is presented. It is shown that, for large values of k (e. g., the median), the proposed algorithm improves the existing upperbound.