Pages that link to "Item:Q5361885"
From MaRDI portal
The following pages link to Parallel algorithms for select and partition with noisy comparisons (Q5361885):
Displaying 11 items.
- Selection algorithms for parallel disk systems (Q1862466) (← links)
- Approximate minimum selection with unreliable comparisons (Q2072098) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice (Q2290640) (← links)
- (Q4614093) (← links)
- (Q4998871) (← links)
- Skyline Computation with Noisy Comparisons (Q5041199) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- (Q5075792) (← links)
- Asymptotically Optimal Sequential Design for Rank Aggregation (Q5868958) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)