| Publication | Date of Publication | Type |
|---|
Reducibility among protocols. (Extended abstract)
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 2022-01-08 | Paper |
Program result checking: a new approach to making programs more reliable
Automata, Languages and Programming | 2019-03-29 | Paper |
Self-correcting for function fields of finite transcendental degree
Automata, Languages and Programming | 2019-01-10 | Paper |
scientific article; zbMATH DE number 6866300 (Why is no real title available?)
(available as arXiv preprint) | 2018-05-03 | Paper |
Checking approximate computations over the reals
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
On effective procedures for speeding up algorithms
Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 | 2014-03-14 | Paper |
Naturally rehearsing passwords
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
| scientific article; zbMATH DE number 2081058 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2009963 (Why is no real title available?) | 2003-11-26 | Paper |
Reflections on the Pentium division bug
IEEE Transactions on Computers | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1256678 (Why is no real title available?) | 1999-03-01 | Paper |
Software reliability via run-time result-checking
Journal of the ACM | 1998-11-04 | Paper |
Designing programs that check their work
Journal of the ACM | 1998-02-02 | Paper |
| scientific article; zbMATH DE number 1003302 (Why is no real title available?) | 1997-04-23 | Paper |
On the problem of sorting burnt pancakes
Discrete Applied Mathematics | 1996-02-13 | Paper |
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences | 1994-09-18 | Paper |
Inductive inference and unsolvability
Journal of Symbolic Logic | 1992-06-27 | Paper |
Noninteractive Zero-Knowledge
SIAM Journal on Computing | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4195192 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4172375 (Why is no real title available?) | 1990-01-01 | Paper |
Reversing trains: A turn of the century sorting problem
Journal of Algorithms | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4101089 (Why is no real title available?) | 1987-01-01 | Paper |
A Simple Unpredictable Pseudo-Random Number Generator
SIAM Journal on Computing | 1986-01-01 | Paper |
Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
Combinatorica | 1986-01-01 | Paper |
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1985-01-01 | Paper |
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
SIAM Journal on Computing | 1984-01-01 | Paper |
Coin flipping by telephone a protocol for solving impossible problems
ACM SIGACT News | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3864496 (Why is no real title available?) | 1983-01-01 | Paper |
The complexity of testing whether a graph is a superconcentrator
Information Processing Letters | 1981-01-01 | Paper |
Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
Information Processing Letters | 1980-01-01 | Paper |
Toward a mathematical theory of inductive inference
Information and Control | 1975-01-01 | Paper |
On Almost Everywhere Complex Recursive Functions
Journal of the ACM | 1974-01-01 | Paper |
On complexity properties of recursively enumerable sets
Journal of Symbolic Logic | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3453574 (Why is no real title available?) | 1974-01-01 | Paper |
Time bounds for selection
Journal of Computer and System Sciences | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3551902 (Why is no real title available?) | 1972-01-01 | Paper |
On Effective Procedures for Speeding Up Algorithms
Journal of the ACM | 1971-01-01 | Paper |
On the Sums of Independently Distributed Pareto Variates
SIAM Journal on Applied Mathematics | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3353266 (Why is no real title available?) | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3353264 (Why is no real title available?) | 1970-01-01 | Paper |
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM | 1967-01-01 | Paper |
On the size of machines
Information and Control | 1967-01-01 | Paper |
A Remarkable Class of Mannheim-Curves
Canadian Mathematical Bulletin | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3188067 (Why is no real title available?) | 1962-01-01 | Paper |
A stagewise parameter estimation procedure for correlated data
Numerische Mathematik | 1961-01-01 | Paper |
