Fragile complexity of adaptive algorithms
From MaRDI portal
Publication:5925676
DOI10.1007/978-3-030-75242-2_10OpenAlexW3164533693MaRDI QIDQ5925676
Prosenjit Bose, John Iacono, Stefan Langerman, Rolf Fagerberg, Riko Jacob, Pilar Cano
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Improved sorting networks with O(log N) depth
- Constructing sorting networks from k-sorters
- Sorting networks of logarithmic depth, further simplified
- Sorting in \(c \log n\) parallel steps
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Pseudorandomness
- Tight Lower Bounds for the Online Labeling Problem
- The periodic balanced sorting network
- Expander graphs and their applications
- Selection Networks
- Lower Bounds on Merging Networks
- A Method of Constructing Selection Networks with $O(\log n)$ Depth
- Comparator networks for binary heap construction
- Zig-zag sort
- Fragile complexity of adaptive algorithms
