Manuel Blum
Papers
1
Total Citations
2
H-Index
1
About
Manuel Blum is a towering figure in theoretical computer science, whose foundational work has shaped our understanding of complexity, cryptography, and artificial intelligence. His research spans computational complexity theory, program verification, and the design of interactive proofs. Blum is perhaps best known for the **Blum-Blum-Shub (BBS) pseudorandom number generator**, a cornerstone of modern cryptography, and for introducing the concept of **"program checking"**—a method to verify that a program's output is correct without re-running the entire computation. His seminal paper on **"Coin Flipping by Telephone"** (1981) laid the groundwork for secure multi-party computation and cryptographic protocols. With over **40,000 citations** across his career, Blum's impact is immense. He also pioneered the **"Blum's speedup theorem"** and contributed to the theory of NP-completeness. In 1995, he received the **Turing Award** for his profound contributions to the foundations of computational complexity and cryptography. A mentor to generations of computer scientists, Blum's work continues to inspire research in algorithms, security, and the theory of computation.
Research Focus
Key Achievements
Top Papers
- 1