Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. A Guide to Experimental Algorithmics
  • Cited by 60
Publisher:
Cambridge University Press
Online publication date:
February 2012
Print publication year:
2012
Online ISBN:
9780511843747
DOI:
https://doi.org/10.1017/CBO9780511843747
Subjects:
Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Software Engineering and Development
Information

Book description

Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure? What inputs should I test? How do I analyze the data? To answer these questions the book draws on ideas from algorithm design and analysis, computer systems, and statistics and data analysis. The wide-ranging discussion includes a tutorial on system clocks and CPU timers, a survey of strategies for tuning algorithms and data structures, a cookbook of methods for generating random combinatorial inputs, and a demonstration of variance reduction techniques. The book can be used by anyone who has taken a course or two in data structures and algorithms. A companion website, AlgLab (www.cs.amherst.edu/alglab) contains downloadable files, programs and tools for use in experimental projects.

Reviews

‘Catherine McGeoch is one of the founders of the field of experimental algorithmics, helping to initiate the discipline with her 1986 dissertation, ‘Experimental Analysis of Algorithms’. She has been deeply involved with the development of the methodology of experimental algorithmics over the past 25 years … This book contains a breadth of advice, examples, and anecdotes, benefiting from her wealth of experience and many collaborations with other innovators in the discipline … Her advice is practical, authoritative, thoughtful, and applicable to the entire range of algorithm design, development, testing, and improvement … McGeoch’s book presents a delightful dance of theoretical and experimental endeavors that in concert provide deep understanding of the algorithms that enable our information age as well as the means to the continual improvement of those fundamental algorithms.’

Richard Snodgrass - University of Arizona

'This book provides guidelines and suggestions for performing experimental algorithmic analysis. It contains many examples and includes links to a companion website with code for some specific experiments … The book is a good read with generally good examples, and is short enough to be easily digested.'

Jeffrey Putnam Source: Computing Reviews

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.