scientific article; zbMATH DE number 7650297

DOI10.4230/LIPICS.ISAAC.2019.64MaRDI QIDQ5875632zbMATH OpenFDO

Authors Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2019.64

zbMATH Keywords

\(p\)-extendible systemsapproximation algorithmsgreedy algorithmhigh-low energymatroids

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Approximate minimum selection with unreliable comparisons
• Energy efficient sorting, selection and searching
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Energy efficient sorting, selection and searching
• Approximate selection with unreliable comparisons in sublinear time

This page was built for publication:

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