hn-classics/_stories/1998/12758176.md

created_at	title	url	author	points	story_text	comment_text	num_comments	story_id	story_title	story_url	parent_id	created_at_i	_tags	objectID	year
2016-10-21T04:40:01.000Z	Dictionary of Algorithms and Data Structures (1998)	https://xlinux.nist.gov/dads/	nullgeo	222			18					1477024801	story author_nullgeo story_12758176	12758176	1998

Dictionary of Algorithms and Data Structures

This web site is hosted by the Software and Systems Division, Information Technology Laboratory, NIST. Development of this dictionary started in 1998 under the editorship of Paul E. Black.

This is a dictionary of algorithms, algorithmic techniques, data structures, archetypal 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. Index pages list entries by area and by type. The two-level index has a total download 1/20 as big as this page.

Don't use this site to cheat. Teachers, contact us if we can help.

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.

Some terms with a leading variable, such as n-way, m-dimensional, or p-branching, are under k-. You may find useful entries in A Glossary of Computer Oriented Abbreviations and Acronyms.

To look up words or phrases, enter them in the box, then click the button.

Web DADS

We thank those who contributed definitions as well as many others who offered suggestions and corrections.

After more than a decade of service as editor of DADS, Paul Black was joined by Vreda Pieterse of the FASTAR group at Stellenbosch University (South Africa), University of Pretoria, and Eindhoven University (Netherlands) as co-editor. The URL https://www.nist.gov/dads/ is an alias which should continue to refer to DADS. We regret any inconvenience this may cause.

Here are some references on algorithms and data structures.

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.

Eric Weisstein's World of Mathematics or MathWorld.

The Sphere online judge (SPOJ) has about 6600 small programming tasks or puzzles and 900 contests. Even nicer it automatically assesses your programs written in 40 languages.

The Computing Research Repository (CoRR).

Eighth International Conference on Fun With Algorithms (FUN 2016). The conference "is dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area."

Bibliography

AS98

Algorithms for Geometric Optimization, ACM Computing Surveys, 30(4):412-458, December 1998.

ATCH99

Atallah**, ed., CRC Press LLC, 1999.

CLR90

Rivest**, Introduction to Algorithms, MIT Press, 1990.

GBY91

Algorithms and Data Structures -- in Pascal and C, 2nd edition, Addison-Wesley, 1991.

GCG92

of Hanoi: Generalizations, Specializations, and Algorithms, Intern. J. Computer Math., 46:149-161, Gordon and Breach Science Publishers S.A., 1992.

GG98

Access Methods, ACM Computing Surveys, 30(2):170-231, June 1998.

GT97

Structures and Algorithms in Java, 2nd edition, John Wiley & Sons, 1997.

Graef06

ACM Computing Surveys, 38(3), Article 10, September 2006.

Hirv01

HS83

Structures, Computer Science Press, 1983.

Knuth97

Addison-Wesley, volumes 1 and 2, 2nd edition, 1997.

Knuth98

Addison-Wesley, volume 3, 2nd edition, 1998.

Leda98

(accessed 4 December 2002).

Sedge97

Stand98

Addison-Wesley, 1998.

Sund98

Communications of the ACM, 33(8):132-142, August 1998.

Vitt01

Structures: Dealing with Massive Data, ACM Computing Surveys, 33(2):209-271, June 2001.

Wier98

Software Specification Methods and Techniques, ACM Computing Surveys, 30(4):459-527, December 1998.

Here are citation examples and an explanation of credit.

Robots, please index all term pages, including spelling variants.

Created Fri Sep 4 16:39:23 1998 This Trailer Updated Mon Sep 18 10:12:55 2017

This page's URL is https://www.nist.gov/dads/