Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
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
Manuel Blum
Filter Results1 entry
Connections

Credited

Source Blum Blum Shub (Wikipedia)

In Field

Cryptography, Fields
Source Wikipedia: Manuel Blum
Source Wikipedia: Manuel Blum

Invented

Source Blum Blum Shub (Wikipedia)
In the Other Atlases

Milestones Credited

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

Is Discussed By

Also in Science Atlas: which discusses this subject.

Source Wikipedia: Manuel Blumtier 2

Member Of

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

Source Wikipedia: Manuel Blumtier 2

Nationality

Also in Geography Atlas: the nationality of this subject.

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
  • 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
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.