scientific article; zbMATH DE number 7765400

DOI10.4230/LIPICS.ISAAC.2020.42arXiv2004.05548MaRDI QIDQ6087214

Adrian Dumitrescu, Unnamed Author

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2004.05548

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tournamentsquantilescommunication complexityapproximate selectioncomparison algorithmmediocre elementi-th order statistic

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved algorithm for finding the median distributively
• Optimal parallel selection has complexity O(log log N)
• Finding the median
• On ``An improved algorithm for finding the median distributively
• Time bounds for selection
• Finding the \(\alpha n\)-th largest element
• A selectable sloppy heap
• On Lower Bounds for Selecting the Median
• Optimal Sampling Strategies in Quicksort and Quickselect
• A New Lower Bound for the Set-Partitioning Problem
• Average case selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Expected time bounds for selection
• Bounds for Selection
• New upper bounds for selection
• A Counting Approach to Lower Bounds for Selection Problems
• Selecting the Median
• Fast Deterministic Selection
• Optimal sampling strategies for quicksort
• Communication Complexity
• Selection Algorithms with Small Groups
• Progress in selection
• Communication Complexity
• Worst-Case Efficient Sorting with QuickMergesort
• Finding a mediocre player

This page was built for publication: