Conference paper
Cell-probe lower bounds for the partial match problem
T.S. Jayram, Subhash Khot, et al.
STOC 2003
Paper
Comparing partial rankings
Abstract
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. © 2006 Society for Industrial and Applied Mathematics.
Related
Andrei Broder, Ravi Kumar, et al.
Computer Networks
Tuǧkan Batu, Sanjoy Dasgupta, et al.
Proceedings of the Annual IEEE Conference on Computational Complexity
Ronald Fagin, Joseph Y. Halpern
Journal of the ACM