Travelled to:1 × Canada
1 × Israel
1 × Poland
1 × United Kingdom
4 × USA
Collaborated with:Y.Mansour ∅ J.Y.Halpern D.J.Lehmann R.A.Servedio C.Thorpe V.R.Pratt L.J.Stockmeyer S.Muthukrishnan M.Yung E.Kushilevitz D.Zuckerman Z.M.Kedem K.V.Palem A.Raghunathan
Talks about:effici (3) comput (3) random (2) high (2) likelihood (1) transform (1) philosoph (1) distribut (1) character (1) transact (1)
Person: Michael O. Rabin
DBLP: Rabin:Michael_O=
Contributed to:
2012
2012
2007
199319921983
19811974Wrote 8 papers:
- ICALP-v1-2012-RabinMMY #performance #strict #transaction #validation
- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (MOR, YM, SM, MY), pp. 738–749.
- ITiCSE-2012-Rabin #student
- Never too early to begin: computer science for high-school students (MOR), p. 1.
- LICS-2007-RabinST #correctness #performance #proving
- Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications (MOR, RAS, CT), pp. 63–76.
- STOC-1993-KushilevitzMRZ #bound #random
- Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.
- STOC-1992-KedemPRR #parallel #performance #program transformation
- Efficient Program Transformations for Resilient Parallel Computation via Randomization (ZMK, KVP, MOR, AR), pp. 306–317.
- STOC-1983-HalpernR #logic
- A Logic to Reason about Likelihood (JYH, MOR), pp. 310–319.
- POPL-1981-LehmannR #distributed #on the #problem #symmetry
- On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem (DJL, MOR), pp. 133–138.
- STOC-1974-PrattRS #power of
- A Characterization of the Power of Vector Machines (VRP, MOR, LJS), pp. 122–134.