This group gathers pioneers of theory of computation whose primary contribution was designing and analyzing algorithms and data structures for general computational problems, including sorting and searching, graph algorithms, numerical and matrix algorithms, randomized and approximation algorithms, data compression, coding theory, and the data structures such as hash tables, B-trees and Fibonacci heaps that support them. It follows the Design and analysis of algorithms second-level heading of the ACM Computing Classification System under Theory of Computation. Their shared work is stating an algorithm precisely and proving how much time, space or other resource it needs, as distinct from classifying which problems admit an efficient algorithm at all, which belongs to Computational Complexity Theory, or building a cryptographic scheme, which belongs to Cryptography and Cryptanalysis.
Facts
Comparison
Era of Emergence All Algorithm Design and Analysis
Filter Results104 entries
Sources
1. Wikipedia: The Art of Computer Programming
Wikimedia FoundationThe Art of Computer Programming, lead section, first volume completion sentenceQuote, The Art of Computer Programming, lead section, first volume completion sentence
The first volume of "The Art of Computer Programming", "Fundamental Algorithms", took five years to complete between 1963 and 1968 while working at both Caltech and Burroughs.
Donald Shell (Wikipedia)
Has Member: Donald Shell, Lead sectionQuote, Has Member: Donald Shell, Lead section
who designed the Shellsort sorting algorithm
Jon Bentley (Wikipedia)
Has Member: Jon Bentley, Lead sectionQuote, Has Member: Jon Bentley, Lead section
known for his contributions to computer programming, algorithms and data structure research
Vladimir Levenshtein (Wikipedia)
Has Member: Vladimir Levenshtein, Lead sectionQuote, Has Member: Vladimir Levenshtein, Lead section
he is known for the Levenshtein distance and a Levenshtein algorithm, which he developed in 1965
Donald Marquardt (Wikipedia)
Has Member: Donald Marquardt, Lead sectionQuote, Has Member: Donald Marquardt, Lead section
was an American statistician, the rediscoverer of the Levenberg
Jon Kleinberg (Wikipedia)
Has Member: Jon Kleinberg, Lead sectionQuote, Has Member: Jon Kleinberg, Lead section
known for his work in algorithms and networks
Abraham Lempel (Wikipedia)
Has Member: Abraham Lempel, Lead sectionQuote, Has Member: Abraham Lempel, Lead section
one of the fathers of the LZ family of lossless data compression algorithms
Jacob Ziv (Wikipedia)
Has Member: Jacob Ziv, Lead sectionQuote, Has Member: Jacob Ziv, Lead section
who developed the LZ family of lossless data compression algorithms alongside Abraham Lempel
Terry Welch (Wikipedia)
Has Member: Terry Welch, Lead sectionQuote, Has Member: Terry Welch, Lead section
Along with Abraham Lempel and Jacob Ziv, he developed the lossless
Kenneth Levenberg (Wikipedia)
Has Member: Kenneth Levenberg, Lead sectionQuote, Has Member: Kenneth Levenberg, Lead section
original author of the widely used nonlinear least squares fitting algorithm
Robert Henry Risch (Wikipedia)
Has Member: Robert Henry Risch, Lead sectionQuote, Has Member: Robert Henry Risch, Lead section
is known for his work on symbolic integration, specifically the Risch algorithm
Michelle Girvan (Wikipedia)
Has Member: Michelle Girvan, Lead sectionQuote, Has Member: Michelle Girvan, Lead section
used to detect community structure in complex systems
Elizabeth Cuthill (Wikipedia)
Has Member: Elizabeth Cuthill, Lead sectionQuote, Has Member: Elizabeth Cuthill, Lead section
known for her work on sparse matrix algorithms
Ronald Graham (Wikipedia)
Has Member: Ronald Graham, Lead sectionQuote, Has Member: Ronald Graham, Lead section
He did important work in scheduling theory, computational geometry
Rudolf E. Kálmán (Wikipedia)
Has Member: Rudolf E. Kálmán, Lead sectionQuote, Has Member: Rudolf E. Kálmán, Lead section
He is most noted for his co-invention and development of the Kalman filter, a mathematical algorithm
Cornelius Lanczos (Wikipedia)
Has Member: Cornelius Lanczos, Career sectionQuote, Has Member: Cornelius Lanczos, Career section
He began conducting research in numerical analysis, and developed a number of concepts in service of early digital computers.
Stefan Kaczmarz (Wikipedia)
Has Member: Stefan Kaczmarz, Lead paragraphQuote, Has Member: Stefan Kaczmarz, Lead paragraph
He is known for introducing the Kaczmarz method
Edouard Lucas (MacTutor)
Has Member: Edouard Lucas, BiographyQuote, Has Member: Edouard Lucas, Biography
devised the test for Mersenne primes still used today
Théophile Pépin (Wikipedia)
Has Member: Théophile Pépin, LeadQuote, Has Member: Théophile Pépin, Lead
He also gave his name to Pépin's test, a test of primality for Fermat numbers
Bruno Buchberger (Wikipedia)
Has Member: Bruno Buchberger, Article textQuote, Has Member: Bruno Buchberger, Article text
In his 1965 Ph.D. thesis, he created the theory of Gröbner bases
Coenraad Bron (Wikipedia)
Has Member: Coenraad Bron, Article textQuote, Has Member: Coenraad Bron, Article text
Together with Joep Kerbosch he invented the Bron-Kerbosch algorithm for the clique problem.
Theodorus Dekker (Wikipedia)
Has Member: Theodorus Dekker, LeadQuote, Has Member: Theodorus Dekker, Lead
Dekker invented an algorithm that allows two processes to share a single-use resource without conflict
Pierre de Fermat (Wikipedia)
Has Member: Pierre de Fermat, WorkQuote, Has Member: Pierre de Fermat, Work
He invented a factorization method
LZ4 (compression algorithm) (Wikipedia)
Has Member: Yann Collet, ImplementationQuote, Has Member: Yann Collet, Implementation
The reference implementation in C by Yann Collet is licensed under a BSD license.
Lempel-Ziv-Oberhumer (Wikipedia)
Has Member: Markus F. X. J. Oberhumer, DesignQuote, Has Member: Markus F. X. J. Oberhumer, Design
was developed by Markus Franz Xaver Johannes Oberhumer
Dormand-Prince method (Wikipedia)
Has Member: John R. Dormand, Lead
Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution.
Has Member: P. J. Prince, Lead
Dormand and Prince chose the coefficients of their method to minimize the error of the fifth-order solution.
View the SourceElwyn Berlekamp (Wikipedia)
Has Member: Elwyn Berlekamp, LeadQuote, Has Member: Elwyn Berlekamp, Lead
Berlekamp invented an algorithm to factor polynomials
Christian Zeller (Wikipedia)
Has Member: Christian Zeller, LeadQuote, Has Member: Christian Zeller, Lead
delivered a short account of his congruence relation
Walter Edwin Arnoldi (source article)
Has Member: Walter Edwin Arnoldi, LeadQuote, Has Member: Walter Edwin Arnoldi, Lead
an eigenvalue algorithm used in numerical linear algebra
James A. Storer (Brandeis home page)
Has Member: James A. Storer, LeadQuote, Has Member: James A. Storer, Lead
data compression and archiving (including text, images, video, and multi-media)
Lempel-Ziv-Storer-Szymanski (source article)
Has Member: Thomas G. Szymanski, LeadQuote, Has Member: Thomas G. Szymanski, Lead
created in 1982 by James A. Storer and Thomas Szymanski
Michael Mitzenmacher (Wikipedia)
Has Member: Michael Mitzenmacher, ResearchQuote, Has Member: Michael Mitzenmacher, Research
Mitzenmacher's research covers the design and analysis of randomised algorithms and processes.
Carl Runge (MacTutor)
Has Member: Carl Runge, SummaryQuote, Has Member: Carl Runge, Summary
Carl Runge worked on a procedure for the numerical solution of algebraic equations
NA Digest, Volume 20, Issue 25: Jeff Cash announcement
Has Member: Jeff R. Cash, NA Digest post, Jeff CashQuote, Has Member: Jeff R. Cash, NA Digest post, Jeff Cash
Jeff's research has been mainly focused on the solution of difference and differential equations, with an emphasis on mathematical software.
Commentz-Walter algorithm (Wikipedia)
Has Member: Beate Commentz-Walter, Lead paragraphQuote, Has Member: Beate Commentz-Walter, Lead paragraph
the Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter
Raita algorithm (Wikipedia)
Has Member: Timo Raita, Lead paragraphQuote, Has Member: Timo Raita, Lead paragraph
This algorithm was published by Timo Raita in 1991
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.