scientific article; zbMATH DE number 7525486
From MaRDI portal
Publication:5075792
DOI10.4230/LIPIcs.ESA.2019.49MaRDI QIDQ5075792
Stefano Leucci, Paolo Penna, Barbara Geissmann, Chih-Hung Liu
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1804.07575
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Energy efficient sorting, selection and searching ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ External-memory sorting with comparison errors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Recursive merge sort with erroneous comparisons
- Coping with errors in binary search procedures
- The Solution Space of Sorting with Recurring Comparison Faults
- Tolerant Algorithms
- Optimal Dislocation with Persistent Errors in Subquadratic Time
- Sorting and Selection with Imprecise Comparisons
- Computing with Noisy Information
- Sorting from Noisier Samples
- Quicksort with Unreliable Comparisons: A Probabilistic Analysis
- Sorting with Recurrent Comparison Errors
- Parallel algorithms for select and partition with noisy comparisons
- Searching games with errors -- fifty years of coping with liars
This page was built for publication:
