Fragile Complexity of Adaptive Algorithms
- 4 May 2021
- book chapter
- Published by Springer Nature
- p. 144-157
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- PseudorandomnessFoundations and Trends® in Theoretical Computer Science, 2012
- Sorting Networks of Logarithmic Depth, Further SimplifiedAlgorithmica, 2007
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- A survey of adaptive sorting algorithmsACM Computing Surveys, 1992
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case timeInformation and Computation, 1992
- Improved sorting networks withO(logN) depthAlgorithmica, 1990
- Constructing sorting networks from k-sortersInformation Processing Letters, 1989
- The periodic balanced sorting networkJournal of the ACM, 1989
- Good worst-case algorithms for inserting and deleting records in dense sequential filesACM SIGMOD Record, 1986
- Lower Bounds on Merging NetworksJournal of the ACM, 1976