Approximate counting of inversions in a data stream

@inproceedings{Ajtai2002ApproximateCO,
  title={Approximate counting of inversions in a data stream},
  author={Mikl{\'o}s Ajtai and T. S. Jayram and Ravi Kumar and D. Sivakumar},
  booktitle={STOC},
  year={2002}
}
(MATH) Inversions are used as a fundamental quantity to measure the sortedness of data, to evaluate different ranking methods for databases, and in the context of rank aggregation. Considering the volume of the data sets in these applications, the data stream model {14, 2] is a natural setting to design efficient algorithms.We obtain a suite of space-efficient streaming algorithms for approximating the number of inversions in a permutation. The best space bound we achieve is $O(\log n \log \log… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 35 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Similar Papers

Loading similar papers…