Skip to main content
  • 288 Accesses

Abstract

The field of Applied Algorithm Design is concerned with applying the results and techniques of Analysis of Algorithms to the real problems faced by practitioners of computing. In this paper we will study the applications of probability and statistics to that endeavor from two viewpoints. First, we will study a general methodology for building efficient programs that employs the tools of data analysis and statistical inference, probabilistic analysis of algorithms, and simulation. Second, we will see how these techniques are used in a detailed study of an application involving the Traveling Salesman Problem, and in a brief overview of several other applications.

This research was supported in part by the Office of Naval Research under Contract N0014-76-C-0370.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A. v., J. E. Hopcroft and J. D. Ullman [1974]. The Design and Analysis of Computer Algorithms Addison-Wesley, Reading, MA.

    Google Scholar 

  • Bentley, J. L. [1979]. “An introduction to algorithm design”, IEEE Computer Magazine 12,2, February 1979, pp. 66–78.

    MathSciNet  Google Scholar 

  • Bentley, J. L. [1981a]. “Probabilistic analysis of algorithms”, to appear in Proceedings of the ORSA-TiMS Special Interest Meeting on Applied ProbabilityComputer Science, The Interface.

    Google Scholar 

  • Bentley, J. L. [1981b]. “Writing efficient code”, CarnegieMellon University Computer Science Technical Report, April 1981.

    Google Scholar 

  • Bentley, J. L. and W. A. Carruthers [1980]. “Algorithms for testing the inclusion of points in polygons”, Eighteenth Annual Allerton Conference on Communication, Control and Computing pp. 11–19, October 1980.

    Google Scholar 

  • Bentley, J. L., D. Haken, and R. Hon [1980]. “Statistics on VLSI designs”, Carnegie-Mellon Computer Science Technical Report CMU-CS·80–111. (A preliminary version is “Fast geometric algorithms for VLSI tasks”, COMPCON Spring 80 pp. 88–92, IEEE.)

    Google Scholar 

  • Bentley, J. L. and J. B. Saxe [1980]. “An analysis of two hEnristics for the Enclidean traveling salesman problem”, Eighteenth Annual Allerton Conference on Communication, Control and Computing pp. 41–49, October 1980.

    Google Scholar 

  • Bentley, J. L. and D. Wood [1980]. “An optimal worst-case algorithm for reporting intersections of rectangles”, IEEE Transactions on Computers C-29, 7, pp. 571–577, July 1980.

    MathSciNet  Google Scholar 

  • Bentley, J. L., B. W. Weide and A. C. Yao [1980]. “Optimal expected-time algorithms for closest-point problems”, ACM Transactions on Mathematical Software 6 4 December 1980, pp. 563 580.

    Google Scholar 

  • Foster, M. J. [1980]. Personal communication of M. J. Foster of Carnegie-Mellon University.

    Google Scholar 

  • Janko, W. [1981]. “Bibliography of probabilistic algorithms”, in preparation.

    Google Scholar 

  • Karp, R. M. [1977]. “Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane”, Mathematics of Operations Research 2, 3, August 1977, pp. 209·224.

    Google Scholar 

  • Knuth, D. E. [1973]. The Art of Computer Programming, volume 3: Sorting and Searching Addison-Wesley, Reading, MA.

    Google Scholar 

  • Lewis, H. and C. H. Papadimitriou [1978]. “The efficiency of algorithms”, Scientific American, January 1978, pp. 97–109.

    Google Scholar 

  • Lueker, G. [1981]. “Algorithms with random inputs”, to appear in Proceedings of Computer Science and Statistics: Thirteenth Annual Symposium on the Interface Pittsburgh, PA, March 1981.

    Google Scholar 

  • Rabin, M. O. [1976]. “Probabilistic algorithms”, in Algorithms and Complexity: New Directions and Recent Results J. F. Traub, Ed., Academic Press, New York, NY, pp. 21–39.

    Google Scholar 

  • Tukey, J. W. [1977]. Exploratory Data AnalysiS AddisonWesley, Reading, MA.

    Google Scholar 

  • Weide, B. W. [1978]. Statistical Methods in Algorithm Design and Analysis, Ph.D. Thesis, Carnegie-Mellon University, August 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag New York Inc.

About this paper

Cite this paper

Bentley, J.L. (1981). Applications of Statistics to Applied Algorithm Design. In: Eddy, W.F. (eds) Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9464-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9464-8_10

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-90633-1

  • Online ISBN: 978-1-4613-9464-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics