Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar  Home/Search
Context Related
| ibm.com/cs/people/jayra...inversions.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: monash.edu.au/~mgabe...WResources (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 [16, 2] is a natural setting to design efficient algorithms. (Update)
Similar documents based on text:
0.7: Approximate Counting of Inversions in a Data Stream - Ajtai, Jayram, Kumar.. (2002) (Correct)
BibTeX entry: (Update)
M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 370--379, 2002. http://citeseer.ist.psu.edu/ajtai02approximate.html More
@misc{ ajtai02approximate,
author = "M. Ajtai and T. Jayram and R. Kumar and D. Sivakumar",
title = "Approximate counting of inversions in a data stream",
text = "M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar. Approximate counting
of inversions in a data stream. In Proceedings of the 34th Annual ACM Symposium
on Theory of Computing (STOC), pages 370--379, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/ajtai02approximate.html" }
Citations (may not include all citations):641 The anatomy of a large-scale hypertextual Web search engine - Brin, Page - 1998
387 The space complexity of approximating the frequency moments - Alon, Matias et al. - 1999
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
33 Sorting permutations by reversals and Eulerian cycle decompo.. - Caprara - 1999
33 Spot-checkers - Ergun, Kannan et al. - 2000
23 Optimal algorithms for list indexing and subset rank (context) - Dietz - 1989
21 Spearman's footrule as a measure of disarray (context) - Diaconis, Graham - 1977
7 Approximate indexed lists - Andersson, Petersson - 1998
4 A survey of adaptive sorting algorithms (context) - Estivill-Castro, Wood - 1992
3 IMS Lecture Series (context) - Diaconis, in et al. - 1988
2 Ranking aggregation methods for the Web (context) - Dwork, Kumar et al. - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csse.monash.edu.au/~mgaber/WResources.htm): More
Temporal Aggregation over Data Streams using Multiple .. - Zhang, Gunopulos.. (2002) (Correct)
Dynamically Maintaining Frequent Items over a Data Stream - Jin, Qian, Sha, Yu, Zhou (2003) (Correct)
Streaming-Data Algorithms for High-Quality Clustering - O'Callaghan, Mishra.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC