Archives
/
papers-we-love_papers-we-love
mirror of https://github.com/papers-we-love/papers-we-love
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'd2acf0fc3b'
${ noResults }
papers-we-love_papers-we-love/experimental_algorithmics/README.md

1014 B
Raw Blame History

Experimental Algorithmics

Experimental algorithmics (sometimes also called empirical algorithmics) is the area within computer science that uses empirical methods to study the behaviour of algorithms. It can be used in the analysis of algorithms (Wikipedia).

Included Papers

  • 📜 A Theoretician's Guide to the Experimental Analysis of Algorithms (David S. Johnson): An exceptionally well-written guide to correctly evaluating algorithms by experimental analysis. The techniques described in this paper do not only apply to theoreticians although the title might lead one to believe so. The examples used in this paper and specifically the method of listing straight-forward principles illustrated by pit-falls and pet peeves make for an excellent must-read for everyone intending to publish experimental algorithm results.