Needs updating, new entries have appeared in the source!
This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information.
- This is a unified index of all terms in the Dictionary. For instance, TSP is listed under "traveling salesman" (one "l" in "traveling"), the American spelling, and "travelling salesman" (two l's), the British spelling. Other variants are "quick sort" and "quicksort", "sort" and "sorting algorithm", and "doubly linked list" and "two-way list". Therefore, please disambiguate by creating a redirect, if possible.
- Some terms with a leading variable, such as n-way, m-dimensional, or p-branching, are under k-.
- Some definitions are copyright CRC Press, such as depoissonization. (These enties are clearly marked.) All others are public domain.
- The articles at the DADS contain some good quality references, external links (and see also section.)
- Cite with
{{DADS|Ackermann's function|ackermann}}
This article incorporates public domain material from Paul E. Black. "Ackermann's function". Dictionary of Algorithms and Data Structures. NIST.
Note: Some of these items are not defined at DADS but instead at http://www-igm.univ-mlv.fr/~lecroq/string/ - see Exact String Matching Algorithms