Multikey quickselect

DOI10.1007/S00453-013-9775-2zbMath1307.68103OpenAlexW2914104284MaRDI QIDQ472494

Leonor Frias, Salvador Roura

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9775-2

zbMATH Keywords

partitionselectionanalysis of algorithmsstringsdivide-and-conqueraverage-case

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Improving multikey Quicksort for sorting strings with many equal elements
• Analytic variations on bucket selection and sorting
• Dynamical sources in information theory: A general analysis of trie structures
• Digital Access to Comparison-Based Tree Data Structures and Algorithms
• Optimal Sampling Strategies in Quicksort and Quickselect
• Radix Exchange—An Internal Sorting Method for Digital Computers
• Improved master theorems for divide-and-conquer recurrences
• The Number of Symbol Comparisons in QuickSort and QuickSelect
• Analysis of quickselect : an algorithm for order statistics
• Automata, Languages and Programming

This page was built for publication: Multikey quickselect