6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2009
Sorting under Partial Information (without the Ellipsoid Algorithm)
Jean Cardinal, Samuel Fiorini, Gwenaël Joret +2
We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially…
cs.DS2008★ 6 cited
An Efficient Algorithm for Partial Order Production
Jean Cardinal, Samuel Fiorini, Gwenaël Joret +2
We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number o…