default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Blum 0001
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
- affiliation: University of California at Berkeley, CA, USA
- award: Turing Award, 1995
Other persons with the same name
- Manuel Blum 0002 — University of Freiburg, Machine Learning Lab, Freiburg im Breisgau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Lenore Blum, Manuel Blum:
AI Consciousness is Inevitable: A Theoretical Computer Science Perspective. CoRR abs/2403.17101 (2024)- 2023
- [i10]Lenore Blum, Manuel Blum:
Viewpoint: A Theoretical Computer Science Perspective on Consciousness and Artificial General Intelligence. CoRR abs/2303.17075 (2023) - 2022
- [i9]Lenore Blum, Manuel Blum:
A Theoretical Computer Science Perspective on Free Will. CoRR abs/2206.13942 (2022) - 2021
- [j28]Manuel Blum, Lenore Blum:
A Theoretical Computer Science Perspective on Consciousness. J. Artif. Intell. Conscious. 8(1): 1-42 (2021) - [i8]Lenore Blum, Manuel Blum:
A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine. CoRR abs/2107.13704 (2021) - 2020
- [j27]Manuel Blum, Santosh S. Vempala
:
The complexity of human computation via a concrete model with an application to passwords. Proc. Natl. Acad. Sci. USA 117(17): 9208-9215 (2020) - [i7]Manuel Blum, Lenore Blum:
A Theoretical Computer Science Perspective on Consciousness. CoRR abs/2011.09850 (2020)
2010 – 2019
- 2019
- [p2]Manuel Blum, Silvio Micali:
How to generate cryptographically strong sequences of pseudo random bits. Providing Sound Foundations for Cryptography 2019: 227-240 - [p1]Manuel Blum, Paul Feldman, Silvio Micali:
Non-interactive zero-knowledge and its applications. Providing Sound Foundations for Cryptography 2019: 329-349 - [i6]Elan Rosenfeld, Santosh S. Vempala, Manuel Blum:
Human-Usable Password Schemas: Beyond Information-Theoretic Security. CoRR abs/1906.00029 (2019) - 2017
- [c44]Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala:
Towards Human Computable Passwords. ITCS 2017: 10:1-10:47 - [i5]Manuel Blum, Santosh S. Vempala:
The Complexity of Human Computation: A Concrete Model with an Application to Passwords. CoRR abs/1707.01204 (2017) - 2016
- [j26]Manuel Blum:
Cybernetics: A mathematician of mind. Nat. 538(7623): 39-40 (2016) - 2015
- [c43]Manuel Blum, Santosh Srinivas Vempala:
Publishable Humanly Usable Secure Password Creation Schemas. HCOMP 2015: 32-41 - [i4]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. IACR Cryptol. ePrint Arch. 2015: 166 (2015) - 2014
- [i3]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Human Computable Passwords. CoRR abs/1404.0024 (2014) - 2013
- [c42]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. ASIACRYPT (2) 2013: 361-380 - [c41]Jeremiah Blocki, Manuel Blum, Anupam Datta:
GOTCHA password hackers! AISec 2013: 25-34 - [i2]Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. CoRR abs/1302.5122 (2013) - [i1]Jeremiah Blocki, Manuel Blum, Anupam Datta:
GOTCHA Password Hackers! CoRR abs/1310.1137 (2013) - 2010
- [c40]Manuel Blum:
Understanding and Inductive Inference. COCOON 2010: 1
2000 – 2009
- 2007
- [c39]Luis von Ahn, Shiry Ginosar, Mihir Kedia, Manuel Blum:
Improving Image Search with PHETCH. ICASSP (4) 2007: 1209-1212 - 2006
- [c38]Luis von Ahn, Ruoran Liu, Manuel Blum:
Peekaboom: a game for locating objects in images. CHI 2006: 55-64 - [c37]Luis von Ahn, Mihir Kedia, Manuel Blum:
Verbosity: a game for collecting common-sense facts. CHI 2006: 75-78 - [c36]Luis von Ahn, Shiry Ginosar, Mihir Kedia, Ruoran Liu, Manuel Blum:
Improving accessibility of the web with a computer game. CHI 2006: 79-82 - 2004
- [j25]Luis von Ahn, Manuel Blum, John Langford:
Telling humans and computers apart automatically. Commun. ACM 47(2): 56-60 (2004) - 2003
- [c35]Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford:
CAPTCHA: Using Hard AI Problems for Security. EUROCRYPT 2003: 294-311 - 2001
- [c34]Nicholas J. Hopper, Manuel Blum:
Secure Human Identification Protocols. ASIACRYPT 2001: 52-66
1990 – 1999
- 1997
- [j24]Hal Wasserman, Manuel Blum:
Software reliability via run-time result-checking. J. ACM 44(6): 826-849 (1997) - [c33]Manuel Blum:
Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). ALT 1997: 1 - 1996
- [j23]Manuel Blum, Hal Wasserman:
Reflections on the Pentium Bug. IEEE Trans. Computers 45(4): 385-393 (1996) - 1995
- [j22]David S. Cohen, Manuel Blum:
on the Problem of Sorting Burnt Pancakes. Discret. Appl. Math. 61(2): 105-120 (1995) - [j21]Manuel Blum, Sampath Kannan:
Designing Programs that Check Their Work. J. ACM 42(1): 269-291 (1995) - [j20]Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith:
Contributions of theoretical computer science. SIGACT News 26(4): 2-4 (1995) - [c32]Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian:
Self-Correcting for Function Fields Transcendental Degree. ICALP 1995: 547-557 - 1994
- [j19]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994) - [c31]Manuel Blum, Hal Wasserman:
Program Result-Checking: A Theory of Testing Meets a Test of Theory. FOCS 1994: 382-392 - [c30]Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky:
Matching Nuts and Bolts. SODA 1994: 690-696 - 1993
- [j18]Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Self-Testing/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci. 47(3): 549-595 (1993) - [c29]Manuel Blum:
Program Result Checking: A New Approach to Making Programs More Reliable. ICALP 1993: 1-14 - [c28]Manuel Blum:
Designing Programs to Check Their Work (Abstract). ISSTA 1993: 1 - [c27]Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell:
Checking approximate computations over the reals. STOC 1993: 786-795 - 1992
- [c26]Manuel Blum, Oded Goldreich:
Towards a Computational Theory of Statistical Tests (Extended Abstract). FOCS 1992: 406-416 - [c25]Manuel Blum:
Universal Statistical Tests. LATIN 1992: 71-75 - 1991
- [j17]Leonard M. Adleman, Manuel Blum:
Inductive Inference and Unsolvability. J. Symb. Log. 56(3): 891-900 (1991) - [j16]Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano:
Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6): 1084-1118 (1991) - [c24]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. FOCS 1991: 90-99 - [c23]Manuel Blum:
Program Checking. FSTTCS 1991: 1-9 - 1990
- [c22]Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Self-Testing/Correcting with Applications to Numerical Problems. STOC 1990: 73-83
1980 – 1989
- 1989
- [j15]Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld:
Reversing Trains: A Turn of the Century Sorting Problem. J. Algorithms 10(3): 413-428 (1989) - [c21]Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Program Result Checking against Adaptive Programs and in Cryptographic Settings. Distributed Computing And Cryptography 1989: 107-118 - [c20]Manuel Blum, Prabhakar Raghavan:
Program Correctness: Can One Test For It? IFIP Congress 1989: 127-134 - [c19]Manuel Blum, Sampath Kannan:
Designing Programs That Check Their Work. STOC 1989: 86-97 - 1988
- [c18]Manuel Blum, Paul Feldman, Silvio Micali:
Proving Security Against Chosen Cyphertext Attacks. CRYPTO 1988: 256-268 - [c17]Manuel Blum, Paul Feldman, Silvio Micali:
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). STOC 1988: 103-112 - 1987
- [c16]Manuel Blum, Russell Impagliazzo:
Generic Oracles and Oracle Classes (Extended Abstract). FOCS 1987: 118-126 - 1986
- [j14]Manuel Blum:
Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. Comb. 6(2): 97-108 (1986) - [j13]Lenore Blum, Manuel Blum, Mike Shub:
A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364-383 (1986) - 1984
- [j12]Manuel Blum, Silvio Micali:
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13(4): 850-864 (1984) - [c15]Manuel Blum, Shafi Goldwasser:
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. CRYPTO 1984: 289-302 - [c14]Manuel Blum:
Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain. FOCS 1984: 425-433 - 1983
- [j11]Manuel Blum:
Coin flipping by telephone a protocol for solving impossible problems. SIGACT News 15(1): 23-27 (1983) - [j10]Manuel Blum:
How to Exchange (Secret) Keys. ACM Trans. Comput. Syst. 1(2): 175-193 (1983) - [c13]Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani:
Reducibility Among Protocols. CRYPTO 1983: 137-146 - [c12]Manuel Blum:
How to Exchange (Secret) Keys (Extended Abstract). STOC 1983: 440-447 - 1982
- [c11]Manuel Blum:
Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. COMPCON 1982: 133-137 - [c10]Lenore Blum, Manuel Blum, Mike Shub:
Comparison of Two Pseudo-Random Number Generators. CRYPTO 1982: 61-78 - [c9]Manuel Blum, Silvio Micali:
How to Generate Cryptographically Strong Sequences of Pseudo Random Bits. FOCS 1982: 112-117 - 1981
- [j9]Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis:
The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. 13(4/5): 164-167 (1981) - [c8]Manuel Blum:
Coin Flipping by Telephone. CRYPTO 1981: 11-15 - 1980
- [j8]Manuel Blum, Ashok K. Chandra, Mark N. Wegman:
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. 10(2): 80-82 (1980)
1970 – 1979
- 1978
- [c7]Manuel Blum, Dexter Kozen:
On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs). FOCS 1978: 132-142 - 1977
- [c6]Manuel Blum, William J. Sakoda:
On the Capability of Finite Automata in 2 and 3 Dimensional Space. FOCS 1977: 147-161 - 1975
- [j7]Lenore Blum, Manuel Blum:
Toward a Mathematical Theory of Inductive Inference. Inf. Control. 28(2): 125-155 (1975) - 1974
- [j6]John Gill, Manuel Blum:
On Almost Everywhere Complex Recursive Functions. J. ACM 21(3): 425-435 (1974) - 1973
- [j5]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
Time Bounds for Selection. J. Comput. Syst. Sci. 7(4): 448-461 (1973) - [j4]Manuel Blum, Ivan Marques:
On Complexity Properties of Recursively Enumerable Sets. J. Symb. Log. 38(4): 579-593 (1973) - [c5]Lenore Blum, Manuel Blum:
Inductive Inference: A Recursion Theoretic Approach. SWAT 1973: 200-208 - 1972
- [c4]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
Linear Time Bounds for Median Computations. STOC 1972: 119-124 - 1971
- [j3]Manuel Blum:
On Effective Procedures for Speeding Up Algorithms. J. ACM 18(2): 290-305 (1971)
1960 – 1969
- 1969
- [c3]Manuel Blum:
On Effective Procedures for Speeding Up Algorithms. STOC 1969: 43-53 - 1968
- [c2]Patrick C. Fischer, Juris Hartmanis, Manuel Blum:
Tape Reversal Complexity Hierarchies. SWAT 1968: 373-382 - 1967
- [j2]Manuel Blum:
On the Size of Machines. Inf. Control. 11(3): 257-265 (1967) - [j1]Manuel Blum:
A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM 14(2): 322-336 (1967) - [c1]Manuel Blum, Carl Hewitt:
Automata on a 2-Dimensional Tape. SWAT 1967: 155-160
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
