On experimental algorithmics: an interview with Catherine McGeoch and Bernard Moret

Authors:
Richard T. Snodgrass
Affiliations:
-
Venue:
Ubiquity
Year:
2011

Citing 7
Cited 0

The average-case analysis of some on-line algorithms for bin packing

Combinatorica
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
The influence of caches on the performance of heaps

Journal of Experimental Algorithmics (JEA)
The influence of caches on the performance of sorting

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Some unexpected expected behavior results for bin packing

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The locality principle

Communications of the ACM - Designing for the mobile device

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computer science is often divided into two camps, systems and theory, but of course the reality is more complicated and more interesting than that. One example is the area of "experimental algorithmics," also termed "empirical algorithmics." This fascinating discipline marries algorithm analysis, which is often done with mathematical proofs, with experimentation with real programs running on real machines.