The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael O. Rabin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael O. Rabin
    Efficient dispersal of information for security, load balancing, and fault tolerance. [Citation Graph (4, 0)][DBLP]
    J. ACM, 1989, v:36, n:2, pp:335-348 [Journal]
  2. Joseph Y. Halpern, Michael O. Rabin
    A Logic to Reason about Likelihood [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:310-319 [Conf]
  3. Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer
    A Characterization of the Power of Vector Machines [Citation Graph (1, 0)][DBLP]
    STOC, 1974, pp:122-134 [Conf]
  4. David C. Parkes, Michael O. Rabin, Stuart M. Shieber, C. A. Thorpe
    Practical secrecy-preserving, verifiably correct and trustworthy auctions. [Citation Graph (0, 0)][DBLP]
    ICEC, 2006, pp:70-81 [Conf]
  5. Michael O. Rabin
    Correctness of Programs and Protocols through Randomization (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ASIAN, 1997, pp:1-3 [Conf]
  6. Michael O. Rabin
    Hyper Encryption and Everlasting Secrets. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:7-10 [Conf]
  7. Yonatan Aumann, Michael O. Rabin
    Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:299-303 [Conf]
  8. Yonatan Aumann, Michael O. Rabin
    Information Theoretically Secure Communication in the Limited Storage Space Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:65-79 [Conf]
  9. Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin
    Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:271-280 [Conf]
  10. Yonatan Aumann, Michael O. Rabin
    Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:147-156 [Conf]
  11. Silvio Micali, Michael O. Rabin, Joe Kilian
    Zero-Knowledge Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:80-91 [Conf]
  12. Silvio Micali, Michael O. Rabin, Salil P. Vadhan
    Verifiable Random Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:120-130 [Conf]
  13. Michael O. Rabin
    N-Process Synchronization by 4 log _2 N-Valued Shared Variables [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:407-410 [Conf]
  14. Michael O. Rabin
    Randomized Byzantine Generals [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:403-409 [Conf]
  15. Michael O. Rabin
    Computationally Hard Algebraic Problems (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:284-289 [Conf]
  16. Michael O. Rabin, J. D. Tygar
    ITOSS: An Integrated Toolkit For Operating System Security. [Citation Graph (0, 0)][DBLP]
    FODO, 1989, pp:2-15 [Conf]
  17. Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin
    Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1995, pp:467-474 [Conf]
  18. Michael O. Rabin
    Theoretical Impediments to Artificial Intelligence. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:615-619 [Conf]
  19. Michael O. Rabin
    Dependable Parallel Computing by Randomization (Abstract). [Citation Graph (0, 0)][DBLP]
    25th Anniversary of INRIA, 1992, pp:19-20 [Conf]
  20. Benny Chor, Michael O. Rabin
    Achieving Independence in Logarithmic Number of Rounds. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:260-268 [Conf]
  21. Rosario Gennaro, Michael O. Rabin, Tal Rabin
    Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:101-111 [Conf]
  22. Eyal Kushilevitz, Michael O. Rabin
    Randomized Mutual Exclusion Algorithms Revisited. [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:275-283 [Conf]
  23. Daniel J. Lehmann, Michael O. Rabin
    On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:133-138 [Conf]
  24. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear Consistency Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:109-120 [Conf]
  25. Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
    Identity-Based Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:180-192 [Conf]
  26. Michael A. Bender, Michael O. Rabin
    Scheduling Cilk multithreaded parallel programs on processors of different speeds. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:13-21 [Conf]
  27. Yan Zong Ding, Michael O. Rabin
    Hyper-Encryption and Everlasting Security. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:1-26 [Conf]
  28. Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan
    Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:306-317 [Conf]
  29. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
    Lower bounds for randomized mutual exclusion. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:154-163 [Conf]
  30. Michael O. Rabin
    The Choice Coordination Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:121-134 [Journal]
  31. Joseph Y. Halpern, Michael O. Rabin
    A Logic to Reason about Likelihood. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1987, v:32, n:3, pp:379-405 [Journal]
  32. Michael O. Rabin
    Complexity of Computations. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1977, v:20, n:9, pp:625-633 [Journal]
  33. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear Consistency Testing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:25, pp:- [Journal]
  34. Michael O. Rabin
    Probabilistic Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1963, v:6, n:3, pp:230-245 [Journal]
  35. Richard M. Karp, Michael O. Rabin
    Efficient Randomized Pattern-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1987, v:31, n:2, pp:249-260 [Journal]
  36. Michael O. Rabin, Hao Wang
    Words in the History of a Turing Machine with a Fixed Input. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1963, v:10, n:4, pp:526-527 [Journal]
  37. Michael O. Rabin, Vijay V. Vazirani
    Maximum Matchings in General Graphs Through Randomization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:4, pp:557-567 [Journal]
  38. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
    Linear-Consistency Testing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:589-607 [Journal]
  39. Michael O. Rabin
    Proving Simultaneous Positivity of Linear Forms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1972, v:6, n:6, pp:639-650 [Journal]
  40. Michael O. Rabin
    N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:1, pp:66-75 [Journal]
  41. Michael O. Rabin
    Transaction Protection by Beacons. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:27, n:2, pp:256-267 [Journal]
  42. Calvin C. Elgot, Michael O. Rabin
    Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1966, v:31, n:2, pp:169-181 [Journal]
  43. Michael O. Rabin
    On Recursively Enumerable and Arithmetic Models of Set Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1958, v:23, n:4, pp:408-416 [Journal]
  44. Michael O. Rabin, Michael Morley
    Meeting of the Association for Symbolic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:4, pp:696-710 [Journal]
  45. Michael A. Bender, Michael O. Rabin
    Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:3, pp:289-304 [Journal]
  46. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman
    Lower Bounds for Randomized Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1550-1563 [Journal]
  47. Michael O. Rabin
    Probabilistic Algorithms in Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:273-280 [Journal]
  48. Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin
    On Lotteries with Unique Winners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:93-98 [Journal]
  49. Yonatan Aumann, Michael O. Rabin
    Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:128, n:1&2, pp:3-30 [Journal]
  50. Yonatan Aumann, Yan Zong Ding, Michael O. Rabin
    Everlasting security in the bounded storage model. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1668-1680 [Journal]
  51. Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe
    Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:63-76 [Conf]
  52. Michael O. Rabin
    DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:506-508 [Conf]

  53. Cryptographic Combinatorial Clock-Proxy Auctions. [Citation Graph (, )][DBLP]


  54. Practical secrecy-preserving, verifiably correct and trustworthy auctions. [Citation Graph (, )][DBLP]


Search in 0.051secs, Finished in 0.054secs
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