Michael O Rabin

You may create the page "Michael O Rabin", but consider checking the search results below to see whether it is already covered.
For search help, please visit Help:Searching.

• Michael O. Rabin
  Michael Oser Rabin. (מִיכָאֵל עוזר רַבִּין ... org/magazines/2010/2/69370-an-interview-with-michael-rabin/abstract "An Interview with Michael O. ...
  13 KB (1,693 words) - 04:13, 5 March 2010
• Dana Scott
  In 1959, he published a joint paper with Michael O. Rabin , a colleague from Princeton, entitled Finite Automata and Their Decision ...
  11 KB (1,499 words) - 21:18, 27 February 2010
• Michael Rabin (violinist)
  For the computer scientist, see Michael O. Rabin .- Michael Rabin (May 2, 1936 January 19, 1972) was an American violin ist of Romanian - ...
  4 KB (443 words) - 16:24, 10 March 2010
• Saharon Shelah
  University | alma_mater Hebrew University | doctoral_advisor Michael O. Rabin | doctoral_students Uri Abraham, Shai Ben-David, Rami ...
  6 KB (696 words) - 14:20, 4 March 2010
• Michael Rabin
  Michael Rabin is the name of two individuals: Michael O. Rabin , a computer scientist Michael Rabin , a violinist.
  168 B (18 words) - 06:40, 2 March 2010
• Rabin signature algorithm
  In cryptography the Rabin Signature Scheme is a method of Digital signature originally proposed by Michael O. Rabin in 1979. ...
  4 KB (716 words) - 02:21, 27 January 2009
• Richard Karp
  In 1987 he co-developed with Michael O. Rabin the Rabin-Karp string search algorithm . Turing Award: His citation for the Turing Award was ...
  7 KB (815 words) - 21:06, 21 January 2010
• Oblivious transfer (section Rabin's oblivious transfer protocol)
  The first form of oblivious transfer was introduced in 1981 by Michael O. Rabin Note1. In this form, the sender sends a message to the ...
  8 KB (1,237 words) - 16:20, 17 November 2009
• Rabin cryptosystem
  The Rabin cryptosystem is an asymmetric cryptographic technique, whose security, ... The process was published in January 1979 by Michael O. ...
  11 KB (1,721 words) - 03:12, 7 March 2010
• Miller–Rabin primality test
  The Miller–Rabin primality test or Rabin–Miller primality test is a primality test ... Riemann hypothesis Michael O. Rabin modified it to ...
  15 KB (2,152 words) - 22:37, 13 March 2010
• Rabin–Karp string search algorithm
  The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to ...
  10 KB (1,654 words) - 21:55, 9 March 2010
• List of Israel Prize recipients
  1995 Rabin, Michael O. | Michael O. Rabin | computer sciences | First recipient of the prize for computer sciences. | 1995 Zach, ...
  64 KB (6,609 words) - 15:47, 7 March 2010
• Nondeterministic finite state machine
  Nondeterministic finite automata were introduced in 1959 by Michael O. Rabin and Dana Scott who also showed their equivalence to ...
  13 KB (1,919 words) - 04:01, 2 March 2010
• Probabilistic automaton
  The concept was introduced by Michael O. Rabin in 1963; a certain special case is sometimes known as the Rabin automaton. In recent years ...
  8 KB (1,234 words) - 17:44, 11 February 2010
• List of important publications in theoretical computer science
  Decidability of second order theories and automata on infinite trees”: Michael O. Rabin Transactions of the American Mathematical Society , ...
  24 KB (3,206 words) - 19:12, 11 February 2010
• Hebrew University of Jerusalem
  Michael O. Rabin , computer science and mathematics Giulio Racah , physics. Mordechai Rotenberg , social work. Gershom Scholem , Jewish ...
  19 KB (2,324 words) - 09:25, 7 March 2010
• Determinacy
  In 1969, Michael O. Rabin proved that the second-order theory of n successors is decidable. A key component of the proof requires showing ...
  17 KB (2,536 words) - 22:07, 30 October 2009
• International Association for Cryptologic Research
  Silvio Micali , Ueli Maurer, Ralph Merkle , Moni Naor , George Blakley , Oded Goldreich , Arjen Lenstra , James Massey , and Michael O. Rabin . ...
  2 KB (214 words) - 16:50, 12 May 2009
• Randomized algorithm
  Historically, the first randomized algorithm was a method developed by Michael O. Rabin for the closest pair problem in computational ...
  16 KB (2,312 words) - 09:45, 18 February 2010
• Alonzo Church
  html Gary Mar, Michael O. Rabin , Nicholas Rescher , Hartley Rogers, Jr., J. Barkley Rosser , Dana Scott , Raymond Smullyan , and Alan ...
  10 KB (1,224 words) - 05:13, 3 March 2010