Experimental algorithmics

Communications of the ACM

Volumn 50, Issue 11, 2007, Pages 27-31

  McGeoch, Catherine C ^a  

^a AMHERST COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM DESIGN; ALGORITHMIC ANALYSIS; FUNDAMENTAL ALGORITHMIC;

COMPUTER PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; SHAPE MEMORY EFFECT;

ALGORITHMS;

EID: 36048995289     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1297797.1297818     Document Type: Article

References (4)

1. Brodal, G., Fagerberg, R., and Vinther, K. Engineering a cache-oblivious sorting algorithm. Journal of Experimental Algorithmics 12 (2007).
2. Cheeseman, P., Kanefsky, B., and Taylor, W. Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, J. Mylopoulos and R. Reiter, Eds. (Sydney, Australia, Aug. 24-30). Morgan Kaufman, San Mateo, CA, 1991, 331-337.
3. Johnson, D. and McGeoch, L. Experimental analysis of heuristics for the STSP. In The Traveling Salesman Problem and Its Variations, G. Gutin and A. Putin, Eds. Kluwer Academic Publishers, Boston, 2002, 369-443.
4. LaMarca, A. and Ladner, R. The influence of caches on the performance ofsorting. Journal of Algorithms 31, 1 (Apr. 1999), 66-104.