This web site is hosted by the Software and Systems Division, Information Technology Laboratory, NIST in collaboration with the FASTAR group.
This site is a dictionary of algorithms, algorithmic techniques, data structures, archetypal problems, and related definitions. The main page includes a description of what subjects are and are not included, entries for about 1400 terms, and lists of references. However it is a lot to download if you have a slow connection or just want to look up one term. The two-column layout of the index takes a noticeable amount of time to render, too.
The two-level index is very brief. The first index has links to secondary index pages, and those link to the entries. This two-level approach trades a little less convenience (two clicks) for a download of about 1/20th the size.
There are additional index pages which list entries by area, for instance, sorting, searching, or graphs, and by type, for example, algorithms or data structures. A page also lists all implementations. We thank those who contributed definitions as well as many others who offered suggestions and corrections.
Currently we do not include algorithms particular to business data processing, communications, operating systems or distributed algorithms, programming languages, AI, graphics, or numerical analysis: it is tough enough covering "general" algorithms and data structures. If you have suggestions, corrections, or comments, please get in touch with Paul Black.
If you don't find a term with a leading variable, such as n-way, m-dimensional, or p-branching, look under k-.
To look up words or phrases, enter them in the box, then click the button.
This page's URL is http://www.nist.gov/dads/twolevelExplain.html