Manuel Blum - RankMe

85 papers A* 27A 3B 3Misc 1Journal 39Unranked 10

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	AI Consciousness is Inevitable: A Theoretical Computer Science Perspective. CoRR Lenore Blum, Manuel Blum
2023	J	`jnl`	Viewpoint: A Theoretical Computer Science Perspective on Consciousness and Artificial General Intelligence. CoRR Lenore Blum, Manuel Blum
2022	J	`jnl`	A Theoretical Computer Science Perspective on Free Will. CoRR Lenore Blum, Manuel Blum
2021	J	`jnl`	A Theoretical Computer Science Perspective on Consciousness. J. Artif. Intell. Conscious. Manuel Blum, Lenore Blum
2021	J	`jnl`	A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine. CoRR Lenore Blum, Manuel Blum
2020	J	`jnl`	A Theoretical Computer Science Perspective on Consciousness. CoRR Manuel Blum, Lenore Blum
2020	J	`jnl`	The complexity of human computation via a concrete model with an application to passwords. Proc. Natl. Acad. Sci. USA Manuel Blum, Santosh S. Vempala
2019	—	`ch.`	How to generate cryptographically strong sequences of pseudo random bits. Providing Sound Foundations for Cryptography Manuel Blum, Silvio Micali
2019	J	`jnl`	Human-Usable Password Schemas: Beyond Information-Theoretic Security. CoRR Elan Rosenfeld, Santosh S. Vempala, Manuel Blum
2019	—	`ch.`	Non-interactive zero-knowledge and its applications. Providing Sound Foundations for Cryptography Manuel Blum, Paul Feldman, Silvio Micali
2017	J	`jnl`	The Complexity of Human Computation: A Concrete Model with an Application to Passwords. CoRR Manuel Blum, Santosh S. Vempala
2017	A	`conf`	Towards Human Computable Passwords. ITCS Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala
2016	J	`jnl`	Cybernetics: A mathematician of mind. Nat. Manuel Blum
2015	J	`jnl`	Naturally Rehearsing Passwords. IACR Cryptol. ePrint Arch. Jeremiah Blocki, Manuel Blum, Anupam Datta
2015	B	`conf`	Publishable Humanly Usable Secure Password Creation Schemas. HCOMP Manuel Blum, Santosh Srinivas Vempala
2014	J	`jnl`	Human Computable Passwords. CoRR Jeremiah Blocki, Manuel Blum, Anupam Datta
2013	J	`jnl`	GOTCHA Password Hackers! CoRR Jeremiah Blocki, Manuel Blum, Anupam Datta
2013	—	`conf`	GOTCHA password hackers! AISec Jeremiah Blocki, Manuel Blum, Anupam Datta
2013	J	`jnl`	Naturally Rehearsing Passwords CoRR Jeremiah Blocki, Manuel Blum, Anupam Datta
2013	—	`conf`	Naturally Rehearsing Passwords. ASIACRYPT (2) Jeremiah Blocki, Manuel Blum, Anupam Datta
2010	Misc	`conf`	Understanding and Inductive Inference. COCOON Manuel Blum
2007	—	`conf`	Improving Image Search with PHETCH. ICASSP (4) Luis von Ahn, Shiry Ginosar, Mihir Kedia, Manuel Blum
2006	A*	`conf`	Improving accessibility of the web with a computer game. CHI Luis von Ahn, Shiry Ginosar, Mihir Kedia, Ruoran Liu, Manuel Blum
2006	A*	`conf`	Peekaboom: a game for locating objects in images. CHI Luis von Ahn, Ruoran Liu, Manuel Blum
2006	A*	`conf`	Verbosity: a game for collecting common-sense facts. CHI Luis von Ahn, Mihir Kedia, Manuel Blum
2004	J	`jnl`	Telling humans and computers apart automatically. Commun. ACM Luis von Ahn, Manuel Blum, John Langford
2003	A*	`conf`	CAPTCHA: Using Hard AI Problems for Security. EUROCRYPT Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford
2001	A	`conf`	Secure Human Identification Protocols. ASIACRYPT Nicholas J. Hopper, Manuel Blum
1997	B	`conf`	Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). ALT Manuel Blum
1997	J	`jnl`	Software reliability via run-time result-checking. J. ACM Hal Wasserman, Manuel Blum
1996	J	`jnl`	Reflections on the Pentium Bug. IEEE Trans. Computers Manuel Blum, Hal Wasserman
1995	J	`jnl`	Contributions of theoretical computer science. SIGACT News Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith
1995	J	`jnl`	Designing Programs that Check Their Work. J. ACM Manuel Blum, Sampath Kannan
1995	A*	`conf`	Self-Correcting for Function Fields Transcendental Degree. ICALP Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian
1995	J	`jnl`	on the Problem of Sorting Burnt Pancakes. Discret. Appl. Math. David S. Cohen, Manuel Blum
1994	J	`jnl`	Checking the Correctness of Memories. Algorithmica Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
1994	A*	`conf`	Matching Nuts and Bolts. SODA Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
1994	A*	`conf`	Program Result-Checking: A Theory of Testing Meets a Test of Theory FOCS Manuel Blum, Hal Wasserman
1993	A*	`conf`	Checking approximate computations over the reals. STOC Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell
1993	A	`conf`	Designing Programs to Check Their Work (Abstract). ISSTA Manuel Blum
1993	A*	`conf`	Program Result Checking: A New Approach to Making Programs More Reliable. ICALP Manuel Blum
1993	J	`jnl`	Self-Testing/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci. Manuel Blum, Michael Luby, Ronitt Rubinfeld
1992	A*	`conf`	Towards a Computational Theory of Statistical Tests (Extended Abstract) FOCS Manuel Blum, Oded Goldreich
1992	B	`conf`	Universal Statistical Tests. LATIN Manuel Blum
1991	A*	`conf`	Checking the Correctness of Memories FOCS Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
1991	J	`jnl`	Inductive Inference and Unsolvability. J. Symb. Log. Leonard M. Adleman, Manuel Blum
1991	J	`jnl`	Noninteractive Zero-Knowledge. SIAM J. Comput. Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano
1991	—	`conf`	Program Checking. FSTTCS Manuel Blum
1990	A*	`conf`	Self-Testing/Correcting with Applications to Numerical Problems STOC Manuel Blum, Michael Luby, Ronitt Rubinfeld
1989	A*	`conf`	Designing Programs That Check Their Work STOC Manuel Blum, Sampath Kannan
1989	—	`conf`	Program Correctness: Can One Test For It? IFIP Congress Manuel Blum, Prabhakar Raghavan
1989	—	`conf`	Program Result Checking against Adaptive Programs and in Cryptographic Settings. Distributed Computing And Cryptography Manuel Blum, Michael Luby, Ronitt Rubinfeld
1989	J	`jnl`	Reversing Trains: A Turn of the Century Sorting Problem. J. Algorithms Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld
1988	A*	`conf`	Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) STOC Manuel Blum, Paul Feldman, Silvio Micali
1988	A*	`conf`	Proving Security Against Chosen Cyphertext Attacks. CRYPTO Manuel Blum, Paul Feldman, Silvio Micali
1987	A*	`conf`	Generic Oracles and Oracle Classes (Extended Abstract) FOCS Manuel Blum, Russell Impagliazzo
1986	J	`jnl`	A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. Lenore Blum, Manuel Blum, Mike Shub
1986	J	`jnl`	Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. Comb. Manuel Blum
1984	A*	`conf`	An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. CRYPTO Manuel Blum, Shafi Goldwasser
1984	J	`jnl`	How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. Manuel Blum, Silvio Micali
1984	A*	`conf`	Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain FOCS Manuel Blum
1983	J	`jnl`	Coin flipping by telephone a protocol for solving impossible problems. SIGACT News Manuel Blum
1983	J	`jnl`	How to Exchange (Secret) Keys ACM Trans. Comput. Syst. Manuel Blum
1983	A*	`conf`	How to Exchange (Secret) Keys (Extended Abstract) STOC Manuel Blum
1983	A*	`conf`	Reducibility Among Protocols. CRYPTO Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani
1982	—	`conf`	Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. COMPCON Manuel Blum
1982	A*	`conf`	Comparison of Two Pseudo-Random Number Generators. CRYPTO Lenore Blum, Manuel Blum, Mike Shub
1982	A*	`conf`	How to Generate Cryptographically Strong Sequences of Pseudo Random Bits FOCS Manuel Blum, Silvio Micali
1981	A*	`conf`	Coin Flipping by Telephone. CRYPTO Manuel Blum
1981	J	`jnl`	The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis
1980	J	`jnl`	Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. Manuel Blum, Ashok K. Chandra, Mark N. Wegman
1978	A*	`conf`	On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) FOCS Manuel Blum, Dexter Kozen
1977	A*	`conf`	On the Capability of Finite Automata in 2 and 3 Dimensional Space FOCS Manuel Blum, William J. Sakoda
1975	J	`jnl`	Toward a Mathematical Theory of Inductive Inference Inf. Control. Lenore Blum, Manuel Blum
1974	J	`jnl`	On Almost Everywhere Complex Recursive Functions. J. ACM John Gill, Manuel Blum
1973	—	`conf`	Inductive Inference: A Recursion Theoretic Approach SWAT Lenore Blum, Manuel Blum
1973	J	`jnl`	On Complexity Properties of Recursively Enumerable Sets. J. Symb. Log. Manuel Blum, Ivan Marques
1973	J	`jnl`	Time Bounds for Selection. J. Comput. Syst. Sci. Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan
1972	A*	`conf`	Linear Time Bounds for Median Computations STOC Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan
1971	J	`jnl`	On Effective Procedures for Speeding Up Algorithms. J. ACM Manuel Blum
1969	A*	`conf`	On Effective Procedures for Speeding Up Algorithms STOC Manuel Blum
1968	—	`conf`	Tape Reversal Complexity Hierarchies SWAT Patrick C. Fischer, Juris Hartmanis, Manuel Blum
1967	J	`jnl`	A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM Manuel Blum
1967	—	`conf`	Automata on a 2-Dimensional Tape SWAT Manuel Blum, Carl Hewitt
1967	J	`jnl`	On the Size of Machines Inf. Control. Manuel Blum