| Publication | Date of Publication | Type |
|---|
| Reducibility Among Protocols | 2022-01-08 | Paper |
| Program result checking: A new approach to making programs more reliable | 2019-03-29 | Paper |
| Self-correcting for function fields of finite transcendental degree | 2019-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638058 | 2018-05-03 | Paper |
| Checking approximate computations over the reals | 2015-05-07 | Paper |
| On effective procedures for speeding up algorithms | 2014-03-14 | Paper |
| Naturally Rehearsing Passwords | 2013-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474165 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434882 | 2003-11-26 | Paper |
| Reflections on the Pentium division bug | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230365 | 1999-03-01 | Paper |
| Software reliability via run-time result-checking | 1998-11-04 | Paper |
| Designing programs that check their work | 1998-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128932 | 1997-04-23 | Paper |
| On the problem of sorting burnt pancakes | 1996-02-13 | Paper |
| Self-testing/correcting with applications to numerical problems | 1994-09-18 | Paper |
| Inductive inference and unsolvability | 1992-06-27 | Paper |
| Noninteractive Zero-Knowledge | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212297 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197310 | 1990-01-01 | Paper |
| Reversing trains: A turn of the century sorting problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826476 | 1987-01-01 | Paper |
| A Simple Unpredictable Pseudo-Random Number Generator | 1986-01-01 | Paper |
| Independent unbiased coin flips from a correlated biased source - a finite state Markov chain | 1986-01-01 | Paper |
| An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information | 1985-01-01 | Paper |
| How to Generate Cryptographically Strong Sequences of Pseudorandom Bits | 1984-01-01 | Paper |
| Coin flipping by telephone a protocol for solving impossible problems | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3332246 | 1983-01-01 | Paper |
| The complexity of testing whether a graph is a superconcentrator | 1981-01-01 | Paper |
| Equivalence of free Boolean graphs can be decided probabilistically in polynomial time | 1980-01-01 | Paper |
| Toward a mathematical theory of inductive inference | 1975-01-01 | Paper |
| On Almost Everywhere Complex Recursive Functions | 1974-01-01 | Paper |
| On complexity properties of recursively enumerable sets | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777269 | 1974-01-01 | Paper |
| Time bounds for selection | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125778 | 1972-01-01 | Paper |
| On Effective Procedures for Speeding Up Algorithms | 1971-01-01 | Paper |
| On the Sums of Independently Distributed Pareto Variates | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628114 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628113 | 1970-01-01 | Paper |
| A Machine-Independent Theory of the Complexity of Recursive Functions | 1967-01-01 | Paper |
| On the size of machines | 1967-01-01 | Paper |
| A Remarkable Class of Mannheim-Curves | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5724326 | 1962-01-01 | Paper |
| A stagewise parameter estimation procedure for correlated data | 1961-01-01 | Paper |
