56 articles
Abraham Lempel
Abraham Lempel (1936–2023) was an Israeli computer scientist who, with Jacob Ziv, created the LZ77 and LZ78 data compression algorithms underlying ZIP, GIF, and PDF, winning the 2007 IEEE Hamming Medal.
Alistair Sinclair
Alistair Sinclair is a computer scientist at UC Berkeley whose research centers on randomized algorithms and Markov chain Monte Carlo, and who won the 1996 Gödel Prize.
Allan Borodin
Allan Borodin is a computer scientist at the University of Toronto, known for the gap theorem, online algorithms, and the 1998 textbook Online Computation and Competitive Analysis.
Amir Ronen
Amir Ronen is a computer scientist who, with Noam Nisan, founded the field of algorithmic mechanism design in a 1999 paper and posed the Nisan–Ronen conjecture.
Amnon Lotem
Amnon Lotem is an Israeli algorithms and technologies expert who won the 2014 Gödel Prize for co-authoring "Optimal Aggregation Algorithms for Middleware", which introduced the threshold algorithm.
Andrei Leman
Andrei Leman (Андрей Андреевич Леман, 1940–2012) was a Soviet computer scientist who co-invented the Weisfeiler–Leman graph algorithm, contributed to the INES database, and helped build Kaissa, the first world champion computer chess program.
Anna Karlin
Anna Karlin is a theoretical computer scientist at the University of Washington known for online algorithms, the power of two choices paradigm, and a 2021 metric TSP improvement.
Arnold L. Rosenberg
Arnold L. Rosenberg is an American theoretical computer scientist who worked at IBM, Duke, and UMass Amherst, known for graph-theoretic models of computation and the Aanderaa–Karp–Rosenberg conjecture.
Barbara Simons
Barbara Simons (Barbara Bluestein Simons), born 1941, is an American computer scientist and former ACM president known for research in scheduling theory and voting security advocacy.
Cal Newport
Cal Newport, also known as Calvin C. Newport, is an American computer scientist at Georgetown University and author of Deep Work (2016) and Digital Minimalism (2019).
Cecilia R. Aragon
Cecilia R. Aragon is an American computer scientist at the University of Washington who co-invented the treap data structure and was a champion aerobatic pilot.
Coenraad Bron
Coenraad Bron (1937–2006) was a Dutch computer scientist who co-authored the 1973 Bron–Kerbosch algorithm for listing maximal cliques, worked in Dijkstra's circle at Eindhoven, and became the University of Groningen's first professor of Informatica in 1983.
Dan Hirschberg
Dan Hirschberg is a computer scientist and Professor Emeritus at the University of California, Irvine, best known for a 1975 algorithm computing a longest common subsequence in linear space.
Dan Willard
Dan Edward Willard (died 2023) was an American computer scientist and SUNY Albany professor known for the x-fast and y-fast tries, fusion trees, and range-searching lower bounds.
David A. Huffman
David A. Huffman (1925–1999) was an American computer scientist who invented Huffman coding in 1952, an optimal compression method still used in JPEG, zip, and fax machines.
David Cory (chemist)
David G. Cory is a Canadian-based physical chemist known for NMR quantum computing, quantum control, and neutron interferometry, a professor at Waterloo since 2010 after MIT.
David S. Johnson
David S. Johnson (1945–2016) was an American computer scientist who laid the foundations of approximation algorithms in his 1973 MIT thesis, coauthored Computers and Intractability, and won the 2010 Knuth Prize.
Donald B. Johnson
Donald B. Johnson was a computer scientist at Pennsylvania State University known for a 1975 algorithm enumerating all elementary circuits of a directed graph and a 1977 shortest-paths algorithm.
Donald Knuth
Donald Knuth, also known as Donald Ervin Knuth, is an American computer scientist at Stanford, author of The Art of Computer Programming and creator of TeX.
Elias Koutsoupias
Elias Koutsoupias, born in Greece in 1963, is a theoretical computer scientist who introduced the price of anarchy with Christos Papadimitriou, winning the 2012 Gödel Prize for the work.
Esko Ukkonen
Esko Ukkonen, born 1950 in Savonlinna, Finland, is a Finnish computer scientist and University of Helsinki professor whose on-line suffix tree construction and edit-distance algorithms became standard tools for DNA sequence analysis in bioinformatics.
F. Thomson Leighton
F. Thomson Leighton, also known as Frank Thomson Leighton, is an American applied mathematician, MIT professor, and co-founder of Akamai Technologies, its chief executive since 2013.
Gary Miller (theoretical computer scientist)
Gary Miller is an American theoretical computer scientist at Carnegie Mellon University, creator of the Miller primality test and the Miller–Rabin test used for RSA encryption keys.
Gene H. Golub
Gene H. Golub, also known as Gene Golub, was an American numerical analyst, the Stanford professor nicknamed "Professor SVD" who made the singular value decomposition practical and co-wrote Matrix Computations.
Gérard Cornuéjols
Gérard Cornuéjols is an operations researcher at Carnegie Mellon University's Tepper School of Business, known for integer programming, lift-and-project cutting planes, and the 2000 Fulkerson Prize.
John Hopcroft
John Hopcroft, full name John Edward Hopcroft, is an American computer scientist at Cornell University who shared the 1986 Turing Award for achievements in algorithms and data structures.
John W. Suurballe
John W. Suurballe is a computer scientist at Bell Telephone Laboratories, best known for his 1974 algorithm finding minimum-total-length node-disjoint paths between two network terminals.
Jon Kleinberg
Jon Kleinberg is a computer scientist at Cornell University in Ithaca, New York, best known for the HITS algorithm and for work on the algorithmic aspects of the small-world phenomenon.
Kurt Mehlhorn
Kurt Mehlhorn is a German computer scientist known for work on algorithms, data structures, and computational geometry, and for starting the LEDA library of efficient data types and algorithms.
Mark Jerrum
Mark Jerrum is a theoretical computer scientist known for randomized algorithms for counting problems, including the 2001 FPRAS for the permanent, which won the 2006 Fulkerson Prize.