Search results
Results from the WOW.Com Content Network
Jeffrey David Ullman (born November 22, 1942) [2] is an American computer scientist and the Stanford W. Ascherman Professor of Engineering, Emeritus, at Stanford University. His textbooks on compilers (various editions are popularly known as the dragon book ), theory of computation (also known as the Cinderella book ), data structures , and ...
In addition to his research work, he is well known for his books on algorithms and formal languages coauthored with Jeffrey Ullman and Alfred Aho, regarded as classic texts in the field. In 1986 he received the Turing Award (jointly with Robert Tarjan ) "for fundamental achievements in the design and analysis of algorithms and data structures."
He is a professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science. [4] Knuth has been called the "father of the analysis of algorithms". [5] Knuth is the author of the multi-volume work The Art of Computer Programming.
The research contributions Guibas is known for include finger trees, red–black trees, fractional cascading, the Guibas–Stolfi algorithm for Delaunay triangulation, an optimal data structure for point location, the quad-edge data structure for representing planar subdivisions, Metropolis light transport, and kinetic data structures for keeping track of objects in motion.
This is a list of well-known data structures. For a wider list of terms, see list of terms relating to algorithms and data structures. For a comparison of running times for a subset of this list see comparison of data structures.
A data structure known as a hash table.. In computer science, a data structure is a data organization and storage format that is usually chosen for efficient access to data. [1] [2] [3] More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, [4] i.e., it is an algebraic structure about data.
Algorithms + Data Structures = Programs [1] is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of system engineering, computer programming, particularly that algorithms and data structures are inherently related.
The NIST Dictionary of Algorithms and Data Structures [1] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures.