Search the dblp DataBase
Manuel Blum :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Manuel Blum , Robert W. Floyd , Vaughan R. Pratt , Ronald L. Rivest , Robert Endre Tarjan Time Bounds for Selection. [Citation Graph (4, 0)][DBLP ] J. Comput. Syst. Sci., 1973, v:7, n:4, pp:448-461 [Journal ] Manuel Blum Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). [Citation Graph (0, 0)][DBLP ] ALT, 1997, pp:1- [Conf ] Nicholas J. Hopper , Manuel Blum Secure Human Identification Protocols. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2001, pp:52-66 [Conf ] Luis von Ahn , Shiry Ginosar , Mihir Kedia , Ruoran Liu , Manuel Blum Improving accessibility of the web with a computer game. [Citation Graph (0, 0)][DBLP ] CHI, 2006, pp:79-82 [Conf ] Luis von Ahn , Mihir Kedia , Manuel Blum Verbosity: a game for collecting common-sense facts. [Citation Graph (0, 0)][DBLP ] CHI, 2006, pp:75-78 [Conf ] Luis von Ahn , Ruoran Liu , Manuel Blum Peekaboom: a game for locating objects in images. [Citation Graph (0, 0)][DBLP ] CHI, 2006, pp:55-64 [Conf ] Manuel Blum Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. [Citation Graph (0, 0)][DBLP ] COMPCON, 1982, pp:133-137 [Conf ] Manuel Blum Coin Flipping by Telephone. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1981, pp:11-15 [Conf ] Manuel Blum , Paul Feldman , Silvio Micali Proving Security Against Chosen Cyphertext Attacks. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1988, pp:256-268 [Conf ] Manuel Blum , Shafi Goldwasser An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1984, pp:289-302 [Conf ] Lenore Blum , Manuel Blum , Mike Shub Comparison of Two Pseudo-Random Number Generators. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1982, pp:61-78 [Conf ] Manuel Blum , Umesh V. Vazirani , Vijay V. Vazirani Reducibility Among Protocols. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1983, pp:137-146 [Conf ] Luis von Ahn , Manuel Blum , Nicholas J. Hopper , John Langford CAPTCHA: Using Hard AI Problems for Security. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2003, pp:294-311 [Conf ] Manuel Blum Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:425-433 [Conf ] Lenore Blum , Manuel Blum Inductive Inference: A Recursion Theoretic Approach [Citation Graph (0, 0)][DBLP ] FOCS, 1973, pp:200-208 [Conf ] Manuel Blum , William S. Evans , Peter Gemmell , Sampath Kannan , Moni Naor Checking the Correctness of Memories [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:90-99 [Conf ] Manuel Blum , Oded Goldreich Towards a Computational Theory of Statistical Tests (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:406-416 [Conf ] Manuel Blum , Carl Hewitt Automata on a 2-Dimensional Tape [Citation Graph (0, 0)][DBLP ] FOCS, 1967, pp:155-160 [Conf ] Manuel Blum , Russell Impagliazzo Generic Oracles and Oracle Classes (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:118-126 [Conf ] Manuel Blum , Dexter Kozen On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) [Citation Graph (0, 0)][DBLP ] FOCS, 1978, pp:132-142 [Conf ] Manuel Blum , Silvio Micali How to Generate Cryptographically Strong Sequences of Pseudo Random Bits [Citation Graph (0, 0)][DBLP ] FOCS, 1982, pp:112-117 [Conf ] Manuel Blum , William J. Sakoda On the Capability of Finite Automata in 2 and 3 Dimensional Space [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:147-161 [Conf ] Manuel Blum , Hal Wasserman Program Result-Checking: A Theory of Testing Meets a Test of Theory [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:382-392 [Conf ] Patrick C. Fischer , Juris Hartmanis , Manuel Blum Tape Reversal Complexity Hierarchies [Citation Graph (0, 0)][DBLP ] FOCS, 1968, pp:373-382 [Conf ] Manuel Blum Program Checking. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1991, pp:1-9 [Conf ] Manuel Blum Program Result Checking: A New Approach to Making Programs More Reliable. [Citation Graph (0, 0)][DBLP ] ICALP, 1993, pp:1-14 [Conf ] Manuel Blum , Bruno Codenotti , Peter Gemmell , Troy Shahoumian Self-Correcting for Function Fields Transcendental Degree. [Citation Graph (0, 0)][DBLP ] ICALP, 1995, pp:547-557 [Conf ] Manuel Blum , Prabhakar Raghavan Program Correctness: Can One Test For It? [Citation Graph (0, 0)][DBLP ] IFIP Congress, 1989, pp:127-134 [Conf ] Manuel Blum Designing Programs to Check Their Work (Abstract). [Citation Graph (0, 0)][DBLP ] ISSTA, 1993, pp:1- [Conf ] Manuel Blum Universal Statistical Tests. [Citation Graph (0, 0)][DBLP ] LATIN, 1992, pp:71-75 [Conf ] Noga Alon , Manuel Blum , Amos Fiat , Sampath Kannan , Moni Naor , Rafail Ostrovsky Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP ] SODA, 1994, pp:690-696 [Conf ] Sigal Ar , Manuel Blum , Bruno Codenotti , Peter Gemmell Checking approximate computations over the reals. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:786-795 [Conf ] Manuel Blum , Paul Feldman , Silvio Micali Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:103-112 [Conf ] Manuel Blum , Robert W. Floyd , Vaughan R. Pratt , Ronald L. Rivest , Robert Endre Tarjan Linear Time Bounds for Median Computations [Citation Graph (0, 0)][DBLP ] STOC, 1972, pp:119-124 [Conf ] Manuel Blum , Sampath Kannan Designing Programs That Check Their Work [Citation Graph (0, 0)][DBLP ] STOC, 1989, pp:86-97 [Conf ] Manuel Blum , Michael Luby , Ronitt Rubinfeld Self-Testing/Correcting with Applications to Numerical Problems [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:73-83 [Conf ] Manuel Blum On Effective Procedures for Speeding Up Algorithms [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:43-53 [Conf ] Manuel Blum How to Exchange (Secret) Keys (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:440-447 [Conf ] Manuel Blum , William S. Evans , Peter Gemmell , Sampath Kannan , Moni Naor Checking the Correctness of Memories. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1994, v:12, n:2/3, pp:225-244 [Journal ] Luis von Ahn , Manuel Blum , John Langford Telling humans and computers apart automatically. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 2004, v:47, n:2, pp:56-60 [Journal ] Manuel Blum Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:2, pp:97-108 [Journal ] David S. Cohen , Manuel Blum on the Problem of Sorting Burnt Pancakes. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:61, n:2, pp:105-120 [Journal ] Manuel Blum On the Size of Machines [Citation Graph (0, 0)][DBLP ] Information and Control, 1967, v:11, n:3, pp:257-265 [Journal ] Lenore Blum , Manuel Blum Toward a Mathematical Theory of Inductive Inference [Citation Graph (0, 0)][DBLP ] Information and Control, 1975, v:28, n:2, pp:125-155 [Journal ] Manuel Blum , Ashok K. Chandra , Mark N. Wegman Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1980, v:10, n:2, pp:80-82 [Journal ] Manuel Blum , Richard M. Karp , Oliver Vornberger , Christos H. Papadimitriou , Mihalis Yannakakis The Complexity of Testing Whether a Graph is a Superconcentrator. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:13, n:4/5, pp:164-167 [Journal ] Manuel Blum A Machine-Independent Theory of the Complexity of Recursive Functions. [Citation Graph (0, 0)][DBLP ] J. ACM, 1967, v:14, n:2, pp:322-336 [Journal ] Manuel Blum On Effective Procedures for Speeding Up Algorithms. [Citation Graph (0, 0)][DBLP ] J. ACM, 1971, v:18, n:2, pp:290-305 [Journal ] Manuel Blum , Sampath Kannan Designing Programs that Check Their Work. [Citation Graph (0, 0)][DBLP ] J. ACM, 1995, v:42, n:1, pp:269-291 [Journal ] John Gill , Manuel Blum On Almost Everywhere Complex Recursive Functions. [Citation Graph (0, 0)][DBLP ] J. ACM, 1974, v:21, n:3, pp:425-435 [Journal ] Hal Wasserman , Manuel Blum Software reliability via run-time result-checking. [Citation Graph (0, 0)][DBLP ] J. ACM, 1997, v:44, n:6, pp:826-849 [Journal ] Nancy M. Amato , Manuel Blum , Sandy Irani , Ronitt Rubinfeld Reversing Trains: A Turn of the Century Sorting Problem. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1989, v:10, n:3, pp:413-428 [Journal ] Manuel Blum , Michael Luby , Ronitt Rubinfeld Self-Testing/Correcting with Applications to Numerical Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1993, v:47, n:3, pp:549-595 [Journal ] Leonard M. Adleman , Manuel Blum Inductive Inference and Unsolvability. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1991, v:56, n:3, pp:891-900 [Journal ] Manuel Blum , Ivan Marques On Complexity Properties of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1973, v:38, n:4, pp:579-593 [Journal ] Lenore Blum , Manuel Blum , Mike Shub A Simple Unpredictable Pseudo-Random Number Generator. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:2, pp:364-383 [Journal ] Manuel Blum , Silvio Micali How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:4, pp:850-864 [Journal ] Manuel Blum , Alfredo De Santis , Silvio Micali , Giuseppe Persiano Noninteractive Zero-Knowledge. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:6, pp:1084-1118 [Journal ] Manuel Blum , Hal Wasserman Reflections on the Pentium Bug. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1996, v:45, n:4, pp:385-393 [Journal ] Manuel Blum How to Exchange (Secret) Keys [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Syst., 1983, v:1, n:2, pp:175-193 [Journal ] Understanding and Inductive Inference. [Citation Graph (, )][DBLP ] Search in 0.025secs, Finished in 0.029secs