A guide to algorithm design. Paradigms, methods, and complexity analysis

MaRDI QIDQ3066391zbMATH OpenFDO

Authors Anne Benoit, Yves Robert, Frédéric Vivien

Publication date 10 January 2011

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Algorithms. Design techniques and analysis
• Techniques for designing and analyzing algorithms
• Fundamentals of parameterized complexity
• Algorithm design: Foundations, analysis, and Internet examples
• The art of algorithm design

Cited in

(2)

• Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
• A Programmer's Companion to Algorithm Analysis

This page was built for publication: A guide to algorithm design. Paradigms, methods, and complexity analysis

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