Algorithm Design and Analysis

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.

who designed the Shellsort sorting algorithm

known for his contributions to computer programming, algorithms and data structure research

he is known for the Levenshtein distance and a Levenshtein algorithm, which he developed in 1965

was an American statistician, the rediscoverer of the Levenberg

known for his work in algorithms and networks

one of the fathers of the LZ family of lossless data compression algorithms

who developed the LZ family of lossless data compression algorithms alongside Abraham Lempel

Along with Abraham Lempel and Jacob Ziv, he developed the lossless

original author of the widely used nonlinear least squares fitting algorithm

is known for his work on symbolic integration, specifically the Risch algorithm

used to detect community structure in complex systems

known for her work on sparse matrix algorithms

He did important work in scheduling theory, computational geometry

He is most noted for his co-invention and development of the Kalman filter, a mathematical algorithm

He began conducting research in numerical analysis, and developed a number of concepts in service of early digital computers.

He is known for introducing the Kaczmarz method

devised the test for Mersenne primes still used today

He also gave his name to Pépin's test, a test of primality for Fermat numbers

In his 1965 Ph.D. thesis, he created the theory of Gröbner bases

Together with Joep Kerbosch he invented the Bron-Kerbosch algorithm for the clique problem.

Dekker invented an algorithm that allows two processes to share a single-use resource without conflict

He invented a factorization method

The reference implementation in C by Yann Collet is licensed under a BSD license.

was developed by Markus Franz Xaver Johannes Oberhumer

Berlekamp invented an algorithm to factor polynomials

delivered a short account of his congruence relation

an eigenvalue algorithm used in numerical linear algebra

data compression and archiving (including text, images, video, and multi-media)

created in 1982 by James A. Storer and Thomas Szymanski

Mitzenmacher's research covers the design and analysis of randomised algorithms and processes.

Carl Runge worked on a procedure for the numerical solution of algebraic equations

Jeff's research has been mainly focused on the solution of difference and differential equations, with an emphasis on mathematical software.

the Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter

This algorithm was published by Timo Raita in 1991

general methods for analyzing the computational complexity of algorithms

preconditioned iterative methods

algorithm for the stable marriage problem

devising an efficient method for solving tridiagonal system of linear equations (Thomas algorithm)

He is best known for his check-digit Verhoeff algorithm

Pratt has made several contributions to foundational areas such as search algorithms, sorting algorithms, and primality testing.

His research interests are in the theory of design and analysis of algorithms.

She is known for Baker's technique for approximation algorithms on planar graphs

The topics of his research include approximation algorithms, streaming algorithms, and metric embeddings.

specializing in data structures, algorithms and computational geometry

professor and co-head of the algorithms research group

Michael Lawrence Fredman is an emeritus professor at the Computer Science Department at Rutgers University, United States. He earned his Ph.

R. Nigel Horspool is a retired professor of computer science, formerly of the University of Victoria. He invented the Boyer-Moore-Horspool

Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.

Nussinov proposed the first dynamic programming approach for nucleic acid secondary structure prediction, this method is now known as the Nussinov algorithm.

Her research interests include sublinear-time algorithms (in particular property testing), randomized algorithms, and computational learning theory.

BLAST tool for sequence analysis

randomized algorithms

is an American computer scientist, the Microsoft Professor of Computer Science & Engineering

is a Chinese mathematician and theoretical computer scientist

Albers' research is in the design and analysis of algorithms, especially online algorithms, approximation algorithms, algorithmic game theory and algorithm engineering.

It was immediately clear to the Gang of Four and John Tomlin that this was a special case of barrier methods

for her combinatorial solution to the carpenter's rule problem

whose research concerns graph algorithms, combinatorial designs, and their applications

In 2011, she was listed as a fellow of the Association for Computing Machinery for her research in computational geometry

program co-chair for the 2012 Symposium on Computational Geometry

which has been named as one of the ten most important algorithms of the twentieth century

He is known for the Kirkpatrick-Seidel algorithm

He first developed the "double description" algorithm of polyhedral combinatorics and computational geometry.

He is best known for creating the Goertzel algorithm.

known for his contributions to the development of numerical methods for the solution of hyperbolic partial differential equations

Concepts that bear Lax's name include the Lax equivalence theorem, which explained when numerical computer approximations would be reliable

signal processing

Borwein has developed an algorithm that applies Chebyshev polynomials to the Dirichlet eta function

Borwein was also an expert on the number pi and especially its computation.

George Lueker's interests are in the area of the design and analysis of algorithms for concrete problems.