scientific article

zbMath1192.94077MaRDI QIDQ3579395

Mark Braverman, Elchanan Mossel

Publication date: 6 August 2010

Full work available at URL: http://dl.acm.org/citation.cfm?id=1347112&CFID=560895561&CFTOKEN=55749386

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05) Sampling theory in information and communication theory (94A20)

Related Items (34)

Iterative algorithm for discrete structure recovery ⋮ Top-\(\kappa\) selection with pairwise comparisons ⋮ Optimal full ranking from pairwise comparisons ⋮ Robust Learning of Consumer Preferences ⋮ Optimal Dislocation with Persistent Errors in Subquadratic Time ⋮ Recurring Comparison Faults: Sorting and Finding the Minimum ⋮ Mallows permutations and finite dependence ⋮ Who Can Win a Single-Elimination Tournament? ⋮ Unnamed Item ⋮ Limit distributions for Euclidean random permutations ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Optimal permutation estimation in crowdsourcing problems ⋮ Worst-case versus average-case design for estimation from partial pairwise comparisons ⋮ Unnamed Item ⋮ External-memory sorting with comparison errors ⋮ Estimation of Monge matrices ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Searching a Tree with Permanently Noisy Advice ⋮ On the cycle structure of Mallows permutations ⋮ Optimal dislocation with persistent errors in subquadratic time ⋮ Simple, Robust and Optimal Ranking from Pairwise Comparisons ⋮ Towards optimal estimation of bivariate isotonic matrices with unknown permutations ⋮ Unnamed Item ⋮ Longest increasing subsequence under persistent comparison errors ⋮ The solution space of sorting with recurring comparison faults ⋮ Resilient Dictionaries for Randomly Unreliable Memory ⋮ The Solution Space of Sorting with Recurring Comparison Faults ⋮ Approximate minimum selection with unreliable comparisons ⋮ Optimizing positional scoring rules for rank aggregation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lengths of monotone subsequences in a Mallows permutation ⋮ Mallows permutations as stable matchings ⋮ Sorting with Recurrent Comparison Errors

This page was built for publication: