Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Pioneer

Manuel Blum

Also Known As M. Blum
Theory of Computation

Manuel Blum is a Venezuelan-born American computer scientist who received the 1995 ACM Turing Award "in recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking". This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Birth Year
1938 1
Birth Date
1938-04-26 1
Award
Turing Award 2
Award
ACM Fellow 2
Award
Fellow of the American Association for the Advancement of Science 2
Award
IACR Fellow 2
Contribution Kind
Theory 3
Highest Honour
Turing Award 1
Connections

Credited

Blum Blum Shub Algorithm, Algorithms
Source Blum Blum Shub (Wikipedia)
Median of medians, Algorithms
Source Median of medians (Wikipedia)

In Field

Cryptography, Fields
Source Wikipedia: Manuel Blum
Theory of Computation, Fields
Source Wikipedia: Manuel Blum

Invented

Blum Blum Shub Algorithm, Algorithms
Source Blum Blum Shub (Wikipedia)

Invented By

Median of medians, Algorithms
Source Median of medians (Wikipedia)

Long-Form Articles

Complexity theory without machine models, Articles
In the Other Atlases

Same As

Manuel Blum

Also in Mathematics Atlas: the same subject.

Milestones Credited

Blum's Speedup Theorem

Also in Mathematics Atlas: a milestone credited to this subject.

Is Discussed By

Turing Award

Also in Science Atlas: which discusses this subject.

Source Wikipedia: Manuel Blumtier 2

Member Of

University of California, Berkeley

Also in Education Atlas: which this subject is a member of.

Source Wikipedia: Manuel Blumtier 2

Nationality

United States

Also in Geography Atlas: the nationality of this subject.

Venezuela

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikipedia: Manuel Blum
Wikimedia Foundation
  • Lead section
    Manuel Blum (born 26 April 1938) is a Venezuelan-born American computer scientist who received the 1995 ACM Turing Award "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".
  • Infobox: birth_date
    April 26, 1938
  • Infobox: awards
    ACM's A.M. Turing Award, 1995 Distinguished Teaching Award, UC Berkeley, 1977 Sigma Xi's Monie A. Ferst Award, 1991 Herbert A.Simon Teaching award, 2007
  • In Field: Theory of Computation, Lead paragraph
  • In Field: Cryptography, Lead paragraph
View the Source
2. Wikidata: Manuel Blum
Wikidata Q92626, class allow-list match (w-wdresolver-0926)View the Source
3. Engineering and Technology History Wiki (ETHW, IEEE): Manuel Blum, Engineering and Technology History Wiki
Engineering and Technology History Wiki (ETHW, IEEE)Biography
Quote, Biography
Manuel Blum is a professor of computer science who has developed the field of computational complexity theory.
View the Source
Median of medians (Wikipedia)
  • Credited: Median of medians, Lead, last paragraph
    sometimes called BFPRT after the last names of the authors (Blum, Floyd, Pratt, Rivest, Tarjan)
  • Invented By: Median of medians, Lead, last paragraph
    The algorithm was published in 1973 and is sometimes called BFPRT after the last names of the authors (Blum, Floyd, Pratt, Rivest, Tarjan).
View the Source
Blum Blum Shub (Wikipedia)
  • Credited: Blum Blum Shub Algorithm, Lead
    Blum Blum Shub (B.B.S.) is a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub that is derived from Michael O.
  • Invented: Blum Blum Shub Algorithm, Lead
    Blum Blum Shub (B.B.S.) is a pseudorandom number generator proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub that is derived from Michael O.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.