Deterministic cache-oblivious funnelselect

DOI10.4230/LIPICS.SWAT.2024.17MaRDI QIDQ6891138zbMATH OpenFDO

Authors Gerth Stølting Brodal, Sebastian Wild

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2024.17

zbMATH Keywords

cache-oblivious algorithmentropy boundsmultiple selection

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Automata, Languages and Programming
• Cache-oblivious algorithms
• Expected time bounds for selection
• Finding the median
• Funnelselect: Cache-oblivious multiple selection
• scientific article; zbMATH DE number 3612276 (Why is no real title available?)
• scientific article; zbMATH DE number 2086641 (Why is no real title available?)
• Multiple Quickselect -- Hoare's Find algorithm for several elements
• Near-optimal online multiselection in internal and external memory
• On the limits of cache-obliviousness
• Optimal Time Minimal Space Selection Algorithms
• Selecting the Median
• Time bounds for selection

Cited in

(1)

• Title not available (Why is no real title available?)

This page was built for publication: Deterministic cache-oblivious funnelselect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891138)