STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Presorting algorithms: an average-case point of view
Theoretical Computer Science
Introduction to algorithms
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n$^{2}$/ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log (n) comparisons are always sufficient.