Michael O. Rabin

From MaRDI portal
Person:208759

Available identifiers

zbMath Open rabin.michael-oWikidataQ357965 ScholiaQ357965MaRDI QIDQ208759

List of research outcomes

PublicationDate of PublicationType
Solving Linear Equations by Means of Scalar Products2021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49916912021-06-03Paper
Randomized mutual exclusion algorithms revisited2017-08-21Paper
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography2016-03-02Paper
Lower bounds for randomized mutual exclusion2015-05-07Paper
Cryptographic Combinatorial Clock-Proxy Auctions2010-01-07Paper
Security in Communication Networks2006-10-10Paper
Everlasting security in the bounded storage model2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q47368252004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44374912003-12-02Paper
Online scheduling of parallel programs on heterogeneous systems with applications to Cilk2002-12-01Paper
Linear-consistency testing.2002-07-02Paper
https://portal.mardi4nfdi.de/entity/Q42303362002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q49418302000-12-18Paper
https://portal.mardi4nfdi.de/entity/Q49418472000-07-26Paper
https://portal.mardi4nfdi.de/entity/Q42493382000-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42636781999-11-21Paper
Lower Bounds for Randomized Mutual Exclusion1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q43912161998-09-13Paper
https://portal.mardi4nfdi.de/entity/Q48584471996-11-04Paper
On Lotteries with Unique Winners1995-05-04Paper
Clock construction in fully asynchronous parallel systems and PRAM simulation1995-04-04Paper
Set systems with no union of cardinality 0 modulo \(m\)1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q42063851990-01-01Paper
Maximum matchings in general graphs through randomization1989-01-01Paper
Efficient dispersal of information for security, load balancing, and fault tolerance1989-01-01Paper
A logic to reason about likelihood1987-01-01Paper
Efficient randomized pattern-matching algorithms1987-01-01Paper
Randomized algorithms in number theory1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37410751985-01-01Paper
Transaction protection by beacons1983-01-01Paper
The choice coordination problem1982-01-01Paper
N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39579411982-01-01Paper
Probabilistic algorithm for testing primality1980-01-01Paper
Linear disjointness and algebraic complexity1980-01-01Paper
Probabilistic Algorithms in Finite Fields1980-01-01Paper
Complexity of computations1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41645691976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40440551974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40501441974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40822961974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41624781974-01-01Paper
Proving simultaneous positivity of linear forms1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40748881972-01-01Paper
Fast evaluation of polynomials by rational preparation1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56325641971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56382971971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56161621970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281071970-01-01Paper
Decidability of Second-Order Theories and Automata on Infinite Trees1969-01-01Paper
Decidability of second-order theories and automata on infinite trees1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55830721967-01-01Paper
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55863491966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55475631965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55862991965-01-01Paper
Real time computation1963-01-01Paper
Probabilistic automata1963-01-01Paper
Words in the History of a Turing Machine with a Fixed Input1963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55183511962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55286361962-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55261301960-01-01Paper
Computable Algebra, General Theory and Theory of Computable Fields1960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55404451960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55592451960-01-01Paper
An Algorithm for a Minimum Cover of a Graph1959-01-01Paper
On recursively enumerable and arithmetic models of set theory1959-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55413391959-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55592291959-01-01Paper
On Codes for Checking Logical Operations1959-01-01Paper
Recursive unsolvability of group theoretic problems1958-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32456371957-01-01Paper
A note on Helly's theorem1955-01-01Paper
https://portal.mardi4nfdi.de/entity/Q58206101953-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael O. Rabin