Michael O. Rabin (born in 1931 with Breslau in Germany, now Wrocław in Poland) is a Informaticien and a member elect of the Prix Turing, the most prestigious reward in the field. Rabin was born son from Rabbin. It received a control of the Hebraic Université of Jerusalem in 1953 and a doctorate of the Université Princeton in 1956.

The quotation for the Turing price, allotted in 1976 jointly to Rabin and Dana Scott for an article writes in 1959, declares that the reward was granted:

For their article " Finite Automata and Their Problem" Decision; presenting the idea of the nondeterministic machines which proved to be a concept of an enormous value. Their traditional article was a continuous source of inspiration for the work which was followed from there in this field.

The nondeterministic machines became a key concept in the algorithmic Complexité, in particular with the description of the classes of complexity P and NP.

In 1957 and 1958, Rabin showed that various problems of theory of groups are indécidables (they are the first of the kind).

In 1969, Rabin showed that the arithmetic monadic one of the second order (with K successors) is décidable.

In 1974, Rabin shows with Michel Fischer that the Arithmétique of Presburger has an super-exponential complexity.

In 1975, Rabin invented a randomized algorithm, the Test of primality of Miller-Rabin, which determines very quickly, but with a tiny probability of error, if a number is a prime number. This algorithm is essential with the implementation of the majority of the algorithms of asymmetrical Cryptographie.

In 1979, Rabin invented the Cryptosystème de Rabin, which is the asymmetrical first cryptosystème whose safety is reduced to the intractability of the factorization of an integer.

In 1981, Rabin invented the technique of the unconscious Transfert, making it possible a shipper to transmit a message to a receiver so that this one has a certain probability, between zero and one, to learn the message, and that the shipper either does not know anything the success of the receiver.

In 1987, Rabin, like Richard Karp, created one of the effective algorithms most well-known of search for character string, the Algorithme of Rabin-Karp.

The current searchs for Rabin concentrate on the safety of the computing systems and he is currently Full professor of the pulpit of data processing Thomas J. Watson Sr. with the University Harvard and professor of data processing to the Hebraic University of Jerusalem.

See too

External bonds

  • short Description in Information Science Hall off Famed at the university of Pittsburgh

  • Quotation of price ACM Turing
  • unconscious Transfer
  • Michael O. Rabin on DBLP

Random links:Jaime de Barros Câmara | Margraviat de Bayreuth | Andre Sandoz | Mariembourg | Aphrodisias