44 citations · 69 across the 30 of their papers we have counts for
1 paper · 2 filters
Boris Ryabko
The problem of ranking can be described as follows. We have a set of combinatorial objects S, such as, say, the k-subsets of n things, and we can imagine that they have been arra…