skip to main content
article
Free Access

Experimental algorithmics

Published:01 November 2007Publication History
Skip Abstract Section

Abstract

Theoretical questions and motivations, combined with empirical research methods, produce insights into algorithm and program performance.

References

  1. Brodal, G., Fagerberg, R., and Vinther, K. Engineering a cache-oblivious sorting algorithm. Journal of Experimental Algorithmics 12 (2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  4. LaMarca, A. and Ladner, R. The influence of caches on the performance of sorting. Journal of Algorithms 31, 1 (Apr. 1999), 66--104. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Experimental algorithmics

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image Communications of the ACM
              Communications of the ACM  Volume 50, Issue 11
              November 2007
              90 pages
              ISSN:0001-0782
              EISSN:1557-7317
              DOI:10.1145/1297797
              Issue’s Table of Contents

              Copyright © 2007 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 November 2007

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format .

            View HTML Format