Noisy sorting without resampling
From MaRDI portal
Recommendations
Cited in
(51)- Top-\(\kappa\) selection with pairwise comparisons
- Sorting by swaps with noisy comparisons
- On the cycle structure of Mallows permutations
- Optimal dislocation with persistent errors in subquadratic time
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations
- Approximate minimum selection with unreliable comparisons
- Iterative algorithm for discrete structure recovery
- Optimal full ranking from pairwise comparisons
- Mallows permutations and finite dependence
- Worst-case versus average-case design for estimation from partial pairwise comparisons
- Estimation of Monge matrices
- Optimizing positional scoring rules for rank aggregation
- Lengths of monotone subsequences in a Mallows permutation
- Limit distributions for Euclidean random permutations
- Round-competitive algorithms for uncertainty problems with parallel queries
- The solution space of sorting with recurring comparison faults
- Noisy binary search and its applications
- Recurring comparison faults: sorting and finding the minimum
- Sorting noisy data with partial information
- Optimal dislocation with persistent errors in subquadratic time
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Sorting from Noisier Samples
- Maximum selection and sorting with adversarial comparators
- Minimax rates and efficient algorithms for noisy sorting
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Selection problems in the presence of implicit bias
- Optimally sorting evolving data
- Searching a Tree with Permanently Noisy Advice
- Top-k and clustering with noisy comparisons
- Mallows permutations as stable matchings
- Optimal sorting with persistent comparison errors
- Resilient Dictionaries for Randomly Unreliable Memory
- Robust Learning of Consumer Preferences
- Sorting with Recurrent Comparison Errors
- scientific article; zbMATH DE number 7306865 (Why is no real title available?)
- Who can win a single-elimination tournament?
- Approximate Sorting
- Approximate Sorting
- Optimal permutation estimation in crowdsourcing problems
- External-memory sorting with comparison errors
- Generalized sorting with predictions revisited
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
- Algorithms for the generalized poset sorting problem
- Approximate selection with unreliable comparisons in sublinear time
- The query complexity of searching trees with permanently noisy advice
- Tangled paths: a random graph model from Mallows permutations
- Learning with comparison feedback: online estimation of sample statistics
- Balanced allocations with the choice of noise
- The entropy of lies: playing twenty questions with a liar
- Optimal level set estimation for non-parametric tournament and crowdsourcing problems
- The solution space of sorting with recurring comparison faults
This page was built for publication: Noisy sorting without resampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579395)
