Counting inversions in lists

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 253-254

  Gupta, Anupam ^a   Zane, Francis X ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; DATA STRUCTURES; ERROR ANALYSIS; THEOREM PROVING;

INVERSIONS; QUANTILE;

INVERSE PROBLEMS;

EID: 0038416086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Miklós Ajtai, T.S. Jayram, S. Ravi Kumar, and D. Sivakumar. Counting inversions in a data stream. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 370-379, 2002.
2. Michael Greenwald and Sanjeev Khanna. Space-efficient online computation of quantile summaries. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 58-66, 2001.
3. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 426-435, 1998.
4. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. In Proceedings ACM SIGMOD International Conference on Management of Data, pages 251-262, 1999.
5. J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoret. Comput. Sci., 12(3):315-323, 1980.