Fragile complexity of adaptive algorithms

DOI10.1007/978-3-030-75242-2_10MaRDI QIDQ5925676zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman

Publication date 22 March 2023

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

Full work available at URL https://doi.org/10.1007/978-3-030-75242-2_10

zbMATH Keywords

algorithmscomparison based algorithmsfragile complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3607502 (Why is no real title available?)
• scientific article; zbMATH DE number 3338920 (Why is no real title available?)
• A Method of Constructing Selection Networks with O(\log n) Depth
• A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
• Comparator networks for binary heap construction
• Constructing sorting networks from k-sorters
• Expander graphs and their applications
• Fragile complexity of adaptive algorithms
• Improved sorting networks with O(log N) depth
• Lower Bounds on Merging Networks
• Pseudorandomness
• Selection Networks
• Sorting in \(c \log n\) parallel steps
• Sorting networks of logarithmic depth, further simplified
• The periodic balanced sorting network
• Tight lower bounds for the online labeling problem
• Zig-zag sort

Cited in

(1)

• Fragile complexity of adaptive algorithms

This page was built for publication: Fragile complexity of adaptive algorithms

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