Approximate sorting

Fundamenta Informaticae

Volumn 90, Issue 1-2, 2009, Pages 67-72

  Giesen, Joachim ^a   Schuberth, Eva ^b   Stojaković, Miloš ^c  

^a Max Plank Institute for Informatics   (Germany)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

Algorithms; Kendall's tau metric; Ranking; Sorting; Spearman's footrule metric

Indexed keywords

CONSTANT FACTORS; DETERMINISTIC ALGORITHMS; KENDALL'S TAU METRIC; RANDOMIZED ALGORITHMS; RANKING; SPEARMAN'S FOOTRULE METRIC; WORST CASE;

ALGORITHMS;

EID: 61449176984     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2009-0005     Document Type: Article

References (8)

1. Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., Tarjan, R. E.: Linear time bounds for median computations, STOC '72: Proceedings of the fourth annual ACM symposium on Theory of computing, ACM Press, 1972.
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms, 2nd ed., The MIT Press/McGraw-Hill, 2001.
3. Diaconis, P., Graham, R. L.: Spearman's Footrule as a Measure of Disarray, Journal of the Royal Statistical Society, 39(2), 1977, 262-268.
4. Hwang, H. K., Yang, B. Y., Yeh, Y N.: Presorting algorithms: an average-case point of view, Theoretical Computer Science, 242(1-2), 2000, 29-40.
5. Kahn, J., Kim, J. H.: Entropy and Sorting, STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, ACM Press, 1992.
6. Knuth, D. E.: The Art of Computer Programming, vol. 3, Addison Wesley, 1973.
7. Mallows, C. L.: Non-null ranking models, Biometrica, 44, 1957, 114-130.
8. Yao, A. C.: Probabilistic computations: Towards a unified measure of complexity, FOCS'77: Proceedings of 18th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1977.