Conference paper
Two applications of information complexity
T.S. Jayram, Ravi Kumar, 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
Ronald Fagin, Joseph Y. Halpern, et al.
Journal of the ACM
Ravi Kumar, D. Sivakumar
ACM-SIAM 2001
Conference paper
Multi-Structural Databases
Ronald Fagin, R. Guha, et al.
SIGMOD/PODS/ 2005