Skip to main content
SpringerLink
Log in

Introduction to Algorithm Design

  • Chapter
The Algorithm Design Manual

Abstract

What is an algorithm? An algorithm is a procedure to accomplish a specific task. An algorithm is the idea behind any reasonable computer program.

To be interesting, an algorithm must solve a general, well-specifiedem problem. An algorithmic problem is specified by describing the complete set of instances it must work on and of its output after running on one of these instances. This distinction, between a problem and an instance of a problem, is fundamental.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Bibliography

  1. F. Brooks. The Mythical Man-Month. Addison-Wesley, Reading MA, 20th anniversary edition, 1995.

    Google Scholar 

  2. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge MA, second edition, 2001.

    MATH  Google Scholar 

  3. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs, volume 57 of Annals of Discrete Mathematics. North Holland, second edition, 2004.

    Google Scholar 

  4. D. Gries. The Science of Programming. Springer-Verlag, 1989.

    Google Scholar 

  5. J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2006.

    Google Scholar 

  6. U. Manber. Introduction to Algorithms. Addison-Wesley, Reading MA, 1989.

    MATH  Google Scholar 

  7. G. Rawlins. Compared to What? Computer Science Press, New York, 1992.

    Google Scholar 

  8. F. Younas and S. Skiena. Randomized algorithms for identifying minimal lottery ticket sets. Journal of Undergraduate Research, 2-2:88–97, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Stony Brook, New York, USA

    Steven S. Skiena

Authors
  1. Steven S. Skiena
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Steven S. Skiena .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Skiena, S.S. (2012). Introduction to Algorithm Design. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-070-4_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-069-8

  • Online ISBN: 978-1-84800-070-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation