WorldCat Identities

Rabin, Michael Oser 1931-

Overview
Works: 16 works in 45 publications in 2 languages and 383 library holdings
Roles: Author
Classifications: QA9, 510
Publication Timeline
.
Most widely held works by Michael Oser Rabin
Automata on infinite objects and Church's problem by Michael Oser Rabin( Book )

7 editions published between 1969 and 1972 in English and held by 299 WorldCat member libraries worldwide

This volume is an outgrowth of a series of lectures presented at the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia, on September 8-12, 1969. The purpose of these notes, which present results reported here for the first time, is twofold. First, to give a quick overview of certain aspects of the mathematical theory of automata and to prove in detail a number of deeper results in this subject. Second, to combine and utilize the various methods, chiefly the method of automata on infinite trees, to obtain a simple and transparent solution of Church's solvability problem
Digitalized signatures and public-key functions as intractable as factorization by Michael O Rabin( Book )

6 editions published in 1979 in English and held by 15 WorldCat member libraries worldwide

We introduce a new class of public-key functions involving a number n = p.q having two large prime factors. As usual, the key n is public, while p and q are the private key used by the issuer for production of signatures and function inversion. These functions can be used for all the applications involving public-key functions, including digitalized signatures. We prove that for any given n, if we can invert the function y = E sub n(x) for even a small percentage of the values y then we can factor n. Thus as long as factorization of large numbers remains practically intractable, for appropriately chosen keys not even a small percentage of signatures are forgerable. Breaking the RSA function is at most as hard as factorization, but is not known to be equivalent to factorization even in the weak sense that ability to invert all function values entails ability to factor the key. Computation time for these functions, i.e., signature verification, is several hundred times faster than for the RSA scheme. Inversion time, using the private key, is comparable. The almost-everywhere intractability of signature-forgery for our functions (on the assumption that factoring is intractable) is of great practical significance and seems to be the first proved result of this kind
ʻAl Profesor Avraham Halevi Frenkel zal; devarim she-amru li-zikhro B. Mazar, A.Y.Y. Poznanski ve-M. Rabin, be-yom 7 be-Kislev 726 (1.12.65) by Benjamin Mazar( Book )

7 editions published in 1965 in Hebrew and held by 13 WorldCat member libraries worldwide

Probabilistic algorithms in finite fields by Michael Oser Rabin( Book )

5 editions published in 1979 in English and Undetermined and held by 13 WorldCat member libraries worldwide

We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial, and factoring a polynomial into its irreducible factors over a finite field. All of these problems are of importance in algebraic coding theory, algebraic symbol manipulation, and number theory. These algorithms have a very transparent, easy to program structure. For finite fields of large characteristic p, so that exhaustive search throng z sub p is not feasible, or algorithms are of lower order in the degrees of the polynomial and fields in question, than previously published algorithms. (Author)
Super-exponential complexity of Presburger arithmetic by Michael J Fischer( Book )

3 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide

Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first order theory of the real numbers under addition, and Presburger arithmetic -- the first order theory of addition on the natural numbers. There is a fixed constant c> 0 such that for every (non-deterministic) decision procedure for determining the truth of sentences of real addition and for all sufficiently large n, there is a sentence of length n for which the decision procedure runs for more than (2 sup (cn)) steps. In the case of Presburger arithmetic, the corresponding bound is 2 sup (2 sup (cn)). These bounds apply also to the minimal lengths of proofs for any complete axiomatization in which the axioms are easily recognized. (Author)
Complexity of computations by Michael Oser Rabin( Recording )

1 edition published in 1976 in English and held by 6 WorldCat member libraries worldwide

Efficient dispersal of information for security load balancing and fault tolerance by Michael Oser Rabin( Book )

2 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide

An integrated toolkit for operating system security by Michael O Rabin( Book )

3 editions published between 1987 and 1988 in English and held by 4 WorldCat member libraries worldwide

Maximum matchings in general graphs through randomization by Michael O Rabin( Book )

2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide

Degree of difficulty of computing a function and a partial ordering of recursive sets by Michael Oser Rabin( Book )

1 edition published in 1960 in English and held by 3 WorldCat member libraries worldwide

Decidability of second-order theories and automata on infinite trees by Michael O Rabin( Book )

2 editions published in 1968 in English and held by 3 WorldCat member libraries worldwide

Efficient dispersal of information for security load balancing and fault tolerance( Visual )

1 edition published in 1987 in English and held by 1 WorldCat member library worldwide

Discussion of an Information Dispersal Algorithm (IDA) used to facilitate secure and reliable storage of information in computer networks and on single disks, efficient transmission of information in networks, and communications between processors in parallel computers
Transaction protection by beacons by Michael O Rabin( Book )

2 editions published in 1981 in English and held by 1 WorldCat member library worldwide

Essays on the foundations of mathematics : dedicated to A.A. Fraenkel on his seventieth anniversary by Universiṭah ha-ʻIvrit bi-Yerushalayim( Book )

1 edition published in 1966 in English and held by 1 WorldCat member library worldwide

Recursive unsolvability of group theoretic problems by Michael Oser Rabin( )

1 edition published in 1957 in English and held by 1 WorldCat member library worldwide

How computers solve impossible problems through unpredictable behavior by Michael Oser Rabin( Visual )

1 edition published in 1981 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.66 (from 0.32 for Complexity ... to 0.95 for Transactio ...)

Alternative Names
Majkl O. Rabin

Michael O. Rabin Israeli computer scientist

Michael O. Rabin israelischer Informatiker

Michael O. Rabin izraelski informatyk

Michael Oser Rabin científico de la computación de Israel

Michael Rabin informaticien israélien

Michael Rabin informatico israeliano

Michael Rabin informaticus uit Israël

Rabiyn Miykaʾel 1931-....

Мајкл О. Рабин

Міхаель Рабін

Рабин, Михаэль Ошер

מיכאל רבין

מיכאל רבין מדען מחשב ישראלי

רבין מיכאל 1931-....

רבין, מיכאל עוזר בן ישראל אברהם

مايكل رابين

مایکل رابین

মাইকেল র‍্যাবিন

마이클 라빈

マイケル・ラビン

米高·拉賓

迈克尔·拉宾

麥可·拉賓

Languages
English (37)

Hebrew (7)