Skyline Computation with Noisy Comparisons
From MaRDI portal
Publication:5041199
DOI10.1007/978-3-030-48966-3_22OpenAlexW3029270599MaRDI QIDQ5041199
Benoît Groz, Claire Mathieu, Víctor Verdugo, Frederik Mallmann-Trenn
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.02058
Cites Work
- Unnamed Item
- Parallel skyline queries
- (Approximate) uncertain skylines
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- On constant factors in comparison-based geometric algorithms and data structures
- Computing in fault tolerant broadcast networks and noisy decision trees
- Instance-Optimal Geometric Algorithms
- On Finding the Maxima of a Set of Vectors
- Computing with Noisy Information
- On the Distribution of the Number of Admissible Points in a Vector Random Sample
- Top-k and Clustering with Noisy Comparisons
- Parallel algorithms for select and partition with noisy comparisons
- Fast Computation of Output-Sensitive Maxima in a Word RAM
- Orthogonal range searching on the RAM, revisited