Elchanan Mossel

activity

20002011

most citedNoisy Sorting Without Resampling

154 citations · 287 across the 29 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2009

Sorting from Noisy Information

Mark Braverman, Elchanan Mossel

This paper studies problems of inferring order given noisy information. In these problems there is an unknown order (permutation) $π$ on $n$ elements denoted by $1, ..., n$ . We assum…

cs.DS2007

Sorting and Selection in Posets

Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel +2

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs…

cs.DS2007★ 154 cited

Noisy Sorting Without Resampling

Mark Braverman, Elchanan Mossel

In this paper we study noisy sorting without re-sampling. In this problem there is an unknown order $a_{π (1)} < ... < a_{π (n)}$ where $π$ is a permutation on $n$ elements. The inpu…