• Thumbnail for Manuel Blum
    Manuel Blum (born 26 April 1938) is a Venezuelan born American computer scientist who received the Turing Award in 1995 "In recognition of his contributions...
    10 KB (715 words) - 03:24, 12 October 2024
  • 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...
    9 KB (1,213 words) - 04:58, 22 May 2024
  • Thumbnail for Avrim Blum
    of two other well-known computer scientists, Manuel Blum, 1995 Turing Award winner, and Lenore Blum. Blum, Avrim, John Hopcroft, and Ravindran Kannan....
    4 KB (206 words) - 07:25, 13 September 2024
  • Thumbnail for Lenore Blum
    Alan Perlis, she shifted fields to mathematics in 1960. She married Manuel Blum, then a student at the Massachusetts Institute of Technology, and transferred...
    17 KB (1,481 words) - 16:44, 15 September 2024
  • deter bot attacks and spam. The term was coined in 2003 by Luis von Ahn, Manuel Blum, Nicholas J. Hopper, and John Langford. It is a contrived acronym for...
    38 KB (3,492 words) - 02:04, 19 October 2024
  • the OEIS) The integers were named for computer scientist Manuel Blum. Given n = p × q a Blum integer, Qn the set of all quadratic residues modulo n and...
    4 KB (433 words) - 00:37, 20 September 2024
  • Thumbnail for Luis von Ahn
    steganography is possible. In 2000, he did early pioneering work with Manuel Blum on CAPTCHAs, computer-generated tests that humans are routinely able...
    21 KB (2,151 words) - 03:55, 18 October 2024
  • Thumbnail for Gary Miller (computer scientist)
    the University of California, Berkeley, in 1975 under the direction of Manuel Blum. Following periods on the faculty at the University of Waterloo, the...
    5 KB (304 words) - 20:25, 29 August 2024
  • Thumbnail for ReCAPTCHA
    reCAPTCHA was originally developed by Luis von Ahn, David Abraham, Manuel Blum, Michael Crawford, Ben Maurer, Colin McMillen, and Edison Tan at Carnegie...
    34 KB (3,044 words) - 17:06, 14 October 2024
  • computable functions. The axioms were first defined by Manuel Blum in 1967. Importantly, Blum's speedup theorem and the Gap theorem hold for any complexity...
    3 KB (423 words) - 03:41, 21 September 2023
  • Thumbnail for Silvio Micali
    University of California, Berkeley in 1982; for research supervised by Manuel Blum. Micali has been on the faculty at MIT, Electrical Engineering and Computer...
    9 KB (624 words) - 07:34, 13 September 2024
  • from 1936 to 1937 Mark Blum (1950–2020), American actor Marty Blum, mayor of Santa Barbara, California (2001 to present) Manuel Blum (born 1938), computer...
    3 KB (411 words) - 16:30, 18 May 2024
  • received his Ph.D. in 1986 from UC Berkeley under the supervision of Manuel Blum. He is the brother of University of California, Irvine professor Vijay...
    7 KB (547 words) - 02:53, 23 September 2024
  • Thumbnail for Moni Naor
    in 1989 at the University of California, Berkeley. His advisor was Manuel Blum. He works in various fields of computer science, mainly the foundations...
    8 KB (678 words) - 22:15, 3 April 2024
  • Thumbnail for Ryan Williams (computer scientist)
    science in 2007 from Carnegie Mellon University under the supervision of Manuel Blum. From 2010 to 2012, he was a member of the Theory Group of IBM Almaden...
    6 KB (545 words) - 09:49, 27 May 2024
  • Thumbnail for Shafi Goldwasser
    in 1984. While at Berkeley, she and her doctoral advisor, Manuel Blum, would propose the Blum-Goldwasser cryptosystem. Goldwasser joined MIT in 1983, and...
    19 KB (1,442 words) - 07:34, 13 September 2024
  • The Blum–Goldwasser (BG) cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum–Goldwasser is...
    9 KB (2,131 words) - 04:08, 5 July 2023
  • Thumbnail for Turing Award
    March 4, 2024. Christos H. Papadimitriou. "A.M. Turing Award Laureate – Manuel Blum". Association for Computing Machinery. Archived from the original on...
    79 KB (3,507 words) - 12:55, 15 October 2024
  • In computational complexity theory, Blum's speedup theorem, first stated by Manuel Blum in 1967, is a fundamental theorem about the complexity of computable...
    3 KB (390 words) - 20:05, 30 December 2023
  • geometric figures, was further developed in their 1947 paper. He worked with Manuel Blum in studying how a neural network can be "logically stable", that is,...
    23 KB (2,759 words) - 08:11, 19 October 2024
  • 1978 Raj Reddy (Professor 1969–present), artificial intelligence, 1994 Manuel Blum (Professor 1999–2018), computational complexity theory, 1995 Edmund M...
    75 KB (8,428 words) - 15:30, 8 October 2024
  • Thumbnail for Michael Sipser
    University of California at Berkeley in 1980 under the direction of Manuel Blum. He joined MIT's Laboratory for Computer Science as a research associate...
    10 KB (852 words) - 19:04, 20 September 2024
  • appeared earliest in works by Manuel Blum, Shimon Even, and Adi Shamir et al. The terminology seems to have been originated by Blum, although commitment schemes...
    47 KB (7,701 words) - 03:26, 6 October 2024
  • Thumbnail for Marvin Minsky
    Doctoral advisor Albert W. Tucker Doctoral students James Robert Slagle Manuel Blum Daniel Bobrow Ivan Sutherland Bertram Raphael William A. Martin Joel...
    34 KB (3,017 words) - 03:40, 14 October 2024
  • Thumbnail for Leonard Adleman
    Cryptography Institutions University of Southern California Thesis Number-Theoretic Aspects of Computational Complexity  (1976) Doctoral advisor Manuel Blum...
    10 KB (813 words) - 16:42, 15 September 2024
  • Thumbnail for Jeffrey Shallit
    was entitled Metric Theory of Pierce Expansions and his advisor was Manuel Blum. Since 1996, Shallit has held the position of Vice-President of Electronic...
    6 KB (481 words) - 23:50, 4 September 2024
  • Thumbnail for Carnegie Mellon School of Computer Science
    strengths. Manuel Blum is the Bruce Nelson Professor of Computer Science and a Turing Award winner. His wife Lenore Blum and son Avrim Blum are also professors...
    22 KB (2,305 words) - 22:06, 14 October 2024
  • Thumbnail for Vijay Vazirani
    dissertation, Maximum Matchings without Blossoms, was supervised by Manuel Blum. After postdoctoral research with Michael O. Rabin and Leslie Valiant...
    10 KB (860 words) - 02:52, 23 September 2024
  • University of California, Berkeley (1990), under the supervision of Manuel Blum. In the years 1990–1992 she did a post-doctorate at Princeton University...
    7 KB (657 words) - 07:31, 13 September 2024
  • information about x (see one-time pad). The following scheme is due to Manuel Blum. In this scenario, Peggy knows a Hamiltonian cycle for a large graph...
    60 KB (7,490 words) - 17:31, 8 October 2024