Top Results for Algorithms

Avi Wigderson is an Israeli computer scientist and mathematician at the Institute for Advanced Study in Princeton. His research spans computational complexity theory, algorithms, and cryptography, where he has made influential contributions to understanding the role of randomness in computation. He...

Jacob Ziv was an Israeli electrical engineer and professor at the Technion who revolutionized digital data storage and transmission. Collaborating with Abraham Lempel, he co-invented the LZ77 and LZ78 lossless data compression algorithms in the late 1970s. These dictionary-based algorithms are compu...

Alfred Aho is a Canadian computer scientist and professor at Columbia University, widely recognized for his foundational work in algorithms and programming languages. During his time at Bell Labs, he co-created the AWK text processing language and invented the Aho-Corasick algorithm for efficient mu...

Christos Papadimitriou is a Greek-American computer scientist and professor at Columbia University. He is a prominent theorist whose work has significantly shaped computational complexity, algorithmic game theory, and the study of internet economics. He authored the 1994 textbook "Computational Comp...

Robert Tarjan is an American computer scientist and professor at Princeton University renowned for his work in graph algorithms and data structures. He developed foundational algorithms for finding strongly connected components in directed graphs and co-invented splay trees, a self-adjusting binary...

Manuel Blum is a Venezuelan-American computer scientist who has served as a professor at the University of California, Berkeley, and Carnegie Mellon University. He made foundational contributions to computational complexity theory by formalizing the axioms of computational complexity and developing...

Peter Shor is an American professor of applied mathematics at the Massachusetts Institute of Technology. He is best known for formulating Shor's algorithm in 1994, a quantum algorithm capable of solving the integer factorization problem in polynomial time. This breakthrough demonstrated that quantum...

Sir Charles Antony Richard "Tony" Hoare is a British computer scientist best known for developing the Quicksort sorting algorithm in 1959 and for creating Hoare logic, a formal system for verifying program correctness. He was awarded the ACM Turing Award in 1980 for these fundamental contributions t...

Abraham Lempel was an Israeli computer scientist who co-invented the Lempel-Ziv (LZ) family of lossless data compression algorithms with Jacob Ziv. Their seminal 1977 and 1978 papers introduced LZ77 and LZ78, which became the foundation for widely used digital formats and protocols, including GIF, T...

Sanjeev Arora is an American theoretical computer scientist and a professor at Princeton University. He is best known for his co-discovery of the PCP theorem in 1998, a landmark result in computational complexity theory that established the hardness of approximating many NP-hard problems. His resear...

Niklaus Wirth is a Swiss computer scientist who designed several influential programming languages, most notably Pascal, Modula-2, and Oberon. He was awarded the Turing Award in 1984 for his sequence of innovative computer languages, which emphasized structured programming and data abstraction. Wirt...

Robert W. Floyd was an American computer scientist who made significant contributions to the theory of algorithms and software engineering. He developed well-known computational methods, including Floyd's shortest path algorithm and his cycle-detection algorithm, as well as foundational work in prog...

Daniel Spielman is an American theoretical computer scientist and professor at Yale University. He co-developed the concept of smoothed analysis of algorithms with Shang-Hua Teng, providing a mathematical framework to explain the practical performance of algorithms like the simplex method. His broad...

Jeffrey Ullman is an American computer scientist renowned for his research in database theory and automata theory. He co-authored several highly influential academic textbooks, including the "Dragon Book" on compiler design with Alfred Aho, and foundational texts on algorithms and databases. He was...

MIT 6.006 Introduction to Algorithms is a foundational computer science course from MIT OpenCourseWare whose freely available lecture videos, taught by faculty including Erik Demaine, cover sorting, graphs, dynamic programming, and complexity.

Nancy Lynch is an American computer scientist and professor at the Massachusetts Institute of Technology, specializing in the theory of distributed computing. She is best known for co-authoring the 1985 FLP impossibility result, which mathematically proved that asynchronous distributed systems canno...

Noga Alon is an Israeli mathematician and computer scientist known for his extensive contributions to combinatorics, graph theory, and theoretical computer science. He is particularly recognized for his application of the probabilistic method to solve discrete mathematics problems. He authored the C...

The MIT 6.006 Introduction to Algorithms course provides a rigorous foundation in computer science concepts. Students learn about essential algorithms and data structures using Python programming. The course focuses on analyzing algorithmic efficiency – specifically time and space complexity – throu...

Jon Kleinberg is the Tisch University Professor of Computer Science at Cornell University. He developed the HITS (Hyperlink-Induced Topic Search) algorithm for web ranking, contemporary with PageRank, and co-authored with David Easley 'Networks, Crowds, and Markets,' a widely used interdisciplinary...

Edsger W. Dijkstra was a prominent Dutch computer scientist whose work fundamentally shaped modern computing. He is best recognized for developing the seminal Shortest Path Algorithm, crucial for network routing and data analysis. His contributions extended to rigorous programming methodologies and...

Kurt Mehlhorn is a German computer scientist and director at the Max Planck Institute for Informatics in Saarbrücken. His research spans algorithms, data structures, and computational geometry, and he co-created the LEDA (Library of Efficient Data types and Algorithms) software library for combinato...

Éva Tardos is a Hungarian-American computer scientist at Cornell University, where she is the Jacob Gould Schurman Professor of Computer Science. Her research centers on algorithms, particularly approximation algorithms for network and scheduling problems, and on algorithmic game theory, where she s...

Rajeev Motwani was a professor of computer science at Stanford University whose research spanned randomized algorithms, approximation algorithms, online algorithms, and web search. He co-authored the textbook 'Randomized Algorithms' (1995) with Prabhakar Raghavan and mentored Larry Page and Sergey B...

Umesh Vazirani is a professor of electrical engineering and computer sciences at the University of California, Berkeley. He is recognized for foundational contributions to quantum computing, including the 1993 paper with Ethan Bernstein that introduced the complexity class BQP and the Bernstein-Vazi...

Bernard Chazelle is the Eugene Higgins Professor of Computer Science at Princeton University. He invented the soft heap data structure in 1999, a priority queue that trades accuracy for speed, and used it to derive improved algorithms for problems in computational geometry. He established important...

Narendra Karmarkar is an Indian mathematician and computer scientist who, in 1984 while at Bell Laboratories, published a polynomial-time interior-point algorithm for linear programming. The algorithm offered competitive practical performance against the simplex method for large-scale optimization p...

Shang-Hua Teng is a Chinese-American theoretical computer scientist at the University of Southern California. He co-developed smoothed analysis of algorithms with Daniel Spielman, a framework for analyzing algorithm performance under slight perturbations of worst-case inputs. This work was recognize...

Ravi Kannan is an Indian computer scientist known for his contributions to theoretical computer science and applied mathematics. He is affiliated with Microsoft Research India and has held academic positions including at Carnegie Mellon University and Yale University. His work includes foundational...

Micha Sharir is an Israeli mathematician and computer scientist at Tel Aviv University. He is known for proving sharp bounds in combinatorial and computational geometry, including foundational results on Davenport-Schinzel sequences and their applications. His research has also contributed to algori...