External-memory sorting with comparison errors

DOI10.1007/978-3-031-38906-1_32OpenAlexW4385358290MaRDI QIDQ6179436

Evrim Ozel, Michael T. Goodrich

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_32

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching with known error probability
• Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
• Optimal dislocation with persistent errors in subquadratic time
• Tolerant Algorithms
• Cache-Oblivious Algorithms
• Engineering a cache-oblivious sorting algorithm
• Computing with Noisy Information
• Minimax Rates and Efficient Algorithms for Noisy Sorting
• Sorting with Recurrent Comparison Errors
• Cache-Oblivious B-Trees
• Searching games with errors -- fifty years of coping with liars