Nalanda Digital Library-National Institute of Technology,Calicut-Dictionary of Algorithms and Data Structures from Nalanda Digital Library

Dictionary of Algorithms and Data Structures
Searchable Version Redistributed by Nalanda Digital Library

Source Files from National Institute of Standards and Technology,USA
Created by Paul E. Beck.

Excerpt from Source Main Page

"This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function.If you can define or correct terms, please contact Paul E. Black. We need help in state machines, combinatorics, parallel and randomized algorithms, heuristics, and quantum computing. We do not include algorithms particular to communications, information processing, operating systems, programming languages, AI, graphics, or numerical analysis: it is tough enough covering "general" algorithms and data structures."

Dictionary of Algorithms and Data Structures by Paul E. Beck,NIST,USA with Search Interface from Nalanda Digital Library

Nalanda Digital Library has converted the dictionary files from the source site into local ASCII database files and has developed a CGI Script to search the local copy of this dictionary.The search box available below can be used to search for terms in the dictionary.Search is case-insensitive and supports phrase search without quoting.All Dictionary terms containing your search terms will be reported.

Here are some references on algorithms and data structures.

[CLR90] Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, MIT Press, 1990.

[HS83] Fundamentals of Data Structures, Ellis Horowitz and Sartaj Sahni, Computer Science Press, 1983.

Algorithms in C, Robert Sedgewick, Addison-Wesley, 1997.

Handbook of Algorithms and Data Structures -- in Pascal and C, G. Gonnet and R. Baeza-Yates, Addison-Wesley, 1991.

The Stony Brook Algorithm Repository, which has algorithms organized by type, succinct, illustrated definitions, and ratings of sites with implementations.

Data Structures and Algorithms is a wonderful site with illustrations, explanations, analysis, and code taking the student from arrays and lists through trees, graphs, and intractable problems.

Bibliography

[AS98] Pankaj K. Agarwal and Micha Sharir, Efficient Algorithms for Geometric Optimization, ACM Computing Surveys, 30(4):412-458, December 1998.

[ATCH99] Algorithms and Theory of Computation Handbook, Mikhail J. Atallah, ed., CRC Press LLC, 1999.

[GCG92] P. Gupta, P. P. Chakrabarti, and S. Ghose, The Towers of Hanoi: Generalizations, Specializations, and Algorithms, Intern. J. Computer Math., 46:149-161, Gordon and Breach Science Publishers S.A., 1992.

[GG98] Volker Gaede and Oliver Günther, Multidimensional Access Methods, ACM Computing Surveys, 30(2):170-231, June 1998.

[Hirv01] Mika Hirvensalo, Quantum Computing, Springer-Verlag, 2001.

[Knuth98] Donald E. Knuth, The Art of Computer Programming, Addison-Wesley, volumes 1, 2, and 3, 3^rd edition, 1998.

[Leda98] LEDA, http://www.algorithmic-solutions.com/as_html/products/leda/ (accessed 5 April 2002).

[Stand98] Thomas Standish, Data Structures in Java, Addison-Wesley, 1998.

[Sund98] Daniel M. Sunday, A Very Fast Substring Search Algorithm, Communications of the ACM, 33(8):132-142, August 1998.

[Vitt01] Jeffrey Scott Vitter, External Memory Algorithms and Data Structures: Dealing with Massive Data, ACM Computing Surveys, 33(2):209-271, June 2001.

[Wier98] Roel Wieringa, A Survey of Structured and Object-Oriented Software Specification Methods and Techniques, ACM Computing Surveys, 30(4):459-527, December 1998.