Beyond the Worst-Case Analysis of Algorithms
From MaRDI portal
Publication:5118515
DOI10.1017/9781108637435zbMATH Open1472.68009OpenAlexW4232418529MaRDI QIDQ5118515FDOQ5118515
Author name not available (Why is that?)
Publication date: 8 September 2020
Full work available at URL: https://doi.org/10.1017/9781108637435
Recommendations
- Certified Algorithms: Worst-Case Analysis and Beyond
- [[:Publication:4866340|Title not available (Why is that?)]]
- [[:Publication:4331754|Title not available (Why is that?)]]
- The worst-case analysis of the Garey-Johnson algorithm
- On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms
- [[:Publication:3782802|Title not available (Why is that?)]]
- Non-polynomial worst-case analysis of recursive programs
- On the efficiency of algorithms of analysis
- [[:Publication:4712964|Title not available (Why is that?)]]
- [[:Publication:3122904|Title not available (Why is that?)]]
Analysis of algorithms (68W40) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Cited In (12)
- On the worst case performance of TESSA
- Mechanism design for perturbation stable combinatorial auctions
- A theory of composition for differential obliviousness
- The simultaneous semi-random model for TSP
- How to hide a clique?
- Robust Factorizations and Colorings of Tensor Graphs
- The simultaneous semi-random model for TSP
- Knapsack secretary through boosting
- Strategyproof facility location in perturbation stable instances
- A criticism of the ACW algorithm
- Beyond the worst case: semi-random complexity analysis of winner determination
- Siting renewable power generation assets with combinatorial optimisation
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)
