Beyond the Worst-Case Analysis of Algorithms
From MaRDI portal
Publication:5118515
Recommendations
- Certified Algorithms: Worst-Case Analysis and Beyond
- scientific article; zbMATH DE number 850316
- scientific article; zbMATH DE number 976346
- The worst-case analysis of the Garey-Johnson algorithm
- On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms
- scientific article; zbMATH DE number 4045178
- Non-polynomial worst-case analysis of recursive programs
- On the efficiency of algorithms of analysis
- scientific article; zbMATH DE number 5267
- scientific article; zbMATH DE number 986985
Cited in
(12)- The simultaneous semi-random model for TSP
- Knapsack secretary through boosting
- Beyond the worst case: semi-random complexity analysis of winner determination
- How to hide a clique?
- A criticism of the ACW algorithm
- Mechanism design for perturbation stable combinatorial auctions
- Siting renewable power generation assets with combinatorial optimisation
- On the worst case performance of TESSA
- Robust Factorizations and Colorings of Tensor Graphs
- Strategyproof facility location in perturbation stable instances
- A theory of composition for differential obliviousness
- The simultaneous semi-random model for TSP
This page was built for publication: Beyond the Worst-Case Analysis of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118515)