Date of Original Version

1-2003

Type

Conference Proceeding

Abstract or Description

In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Lε[m]n using two passes and O(ε−1-√n log n(log m + log n)) space. Here, we present a simple randomized streaming algorithm for the same problem that uses one pass and O(ε−3 log2 n log m) space. Our algorithm is based on estimating quantiles of the items already seen in the stream, and using that to estimate the number of inversions involving each element.

Share

COinS
 

Published In

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , 253-254.