The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Manuel Blum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Manuel Blum
    Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:1- [Conf]
  3. Nicholas J. Hopper, Manuel Blum
    Secure Human Identification Protocols. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:52-66 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Manuel Blum
    Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. [Citation Graph (0, 0)][DBLP]
    COMPCON, 1982, pp:133-137 [Conf]
  8. Manuel Blum
    Coin Flipping by Telephone. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:11-15 [Conf]
  9. Manuel Blum, Paul Feldman, Silvio Micali
    Proving Security Against Chosen Cyphertext Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:256-268 [Conf]
  10. 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]
  11. Lenore Blum, Manuel Blum, Mike Shub
    Comparison of Two Pseudo-Random Number Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:61-78 [Conf]
  12. Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani
    Reducibility Among Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:137-146 [Conf]
  13. 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]
  14. 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]
  15. Lenore Blum, Manuel Blum
    Inductive Inference: A Recursion Theoretic Approach [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:200-208 [Conf]
  16. 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]
  17. Manuel Blum, Oded Goldreich
    Towards a Computational Theory of Statistical Tests (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:406-416 [Conf]
  18. Manuel Blum, Carl Hewitt
    Automata on a 2-Dimensional Tape [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:155-160 [Conf]
  19. Manuel Blum, Russell Impagliazzo
    Generic Oracles and Oracle Classes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:118-126 [Conf]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. Patrick C. Fischer, Juris Hartmanis, Manuel Blum
    Tape Reversal Complexity Hierarchies [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:373-382 [Conf]
  25. Manuel Blum
    Program Checking. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:1-9 [Conf]
  26. Manuel Blum
    Program Result Checking: A New Approach to Making Programs More Reliable. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:1-14 [Conf]
  27. 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]
  28. Manuel Blum, Prabhakar Raghavan
    Program Correctness: Can One Test For It? [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:127-134 [Conf]
  29. Manuel Blum
    Designing Programs to Check Their Work (Abstract). [Citation Graph (0, 0)][DBLP]
    ISSTA, 1993, pp:1- [Conf]
  30. Manuel Blum
    Universal Statistical Tests. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:71-75 [Conf]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. Manuel Blum, Sampath Kannan
    Designing Programs That Check Their Work [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:86-97 [Conf]
  36. 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]
  37. Manuel Blum
    On Effective Procedures for Speeding Up Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:43-53 [Conf]
  38. Manuel Blum
    How to Exchange (Secret) Keys (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:440-447 [Conf]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. Manuel Blum
    On the Size of Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1967, v:11, n:3, pp:257-265 [Journal]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. 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]

  61. Understanding and Inductive Inference. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002