Skip to main content
SpringerLink
Log in

Algorithmic Resources

  • Chapter
The Algorithm Design Manual

  • 228k Accesses

Abstract

This chapter briefly describes resources that the practical algorithm designer should be familiar with. Although some of this information has appeared elsewhere in the catalog, the most important pointers are collected here for general reference.

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. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading MA, 1974.

    MATH  Google Scholar 

  2. A. Aho, J. Hopcroft, and J. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading MA, 1983.

    MATH  Google Scholar 

  3. A. Binstock and J. Rex. Practical Algorithms for Programmers. Addison-Wesley, Reading MA, 1995.

    MATH  Google Scholar 

  4. S. Baase and A. van Gelder. Computer Algorithms. Addison-Wesley, Reading MA, third edition, 1999.

    Google Scholar 

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

    MATH  Google Scholar 

  6. G. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, Wokingham, England, second edition, 1991.

    Google Scholar 

  7. D. Knuth. The Stanford GraphBase: a platform for combinatorial computing. ACM Press, New York, 1994.

    MATH  Google Scholar 

  8. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, Fort Worth TX, 1976.

    Google Scholar 

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

    MATH  Google Scholar 

  10. K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.

    Google Scholar 

  11. B. Moret and H. Shapiro. Algorithm from P to NP: Design and Efficiency. Benjamin/Cummings, Redwood City, CA, 1991.

    Google Scholar 

  12. A. Nijenhuis and H. Wilf. Combinatorial Algorithms for Computers and Calculators. Academic Press, Orlando FL, second edition, 1978.

    MATH  Google Scholar 

  13. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.

    Google Scholar 

  14. S. Pemmaraju and S. Skiena. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, New York, 2003.

    MATH  Google Scholar 

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

    Google Scholar 

  16. G. Reinelt. TSPLIB – a traveling salesman problem library. ORSA J. Computing, 3:376–384, 1991.

    MATH  Google Scholar 

  17. M. Syslo, N. Deo, and J. Kowalik. Discrete Optimization Algorithms with Pascal Programs. Prentice Hall, Englewood Cliffs NJ, 1983.

    MATH  Google Scholar 

  18. J. Siek, L. Lee, and A. Lumsdaine. The Boost Graph Library: user guide and reference manual. Addison Wesley, Boston, 2002.

    Google Scholar 

  19. S. Skiena and M. Revilla. Programming Challenges: The Programming Contest Training Manual. Springer-Verlag, 2003.

    Google Scholar 

  20. J. van Leeuwen, editor. Handbook of Theoretical Computer Science: Algorithms and Complexity, volume A. MIT Press, 1990.

    Google Scholar 

  21. H. Wilf. Combinatorial Algorithms: an update. SIAM, Philadelphia PA, 1989.

    Book  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). Algorithmic Resources. In: The Algorithm Design Manual. Springer, London. https://doi.org/10.1007/978-1-84800-070-4_19

Download citation

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

  • 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