| Publication | Date of Publication | Type |
|---|
| Solving Linear Equations by Means of Scalar Products | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4991691 | 2021-06-03 | Paper |
| Randomized mutual exclusion algorithms revisited | 2017-08-21 | Paper |
| Simplified VSS and fast-track multiparty computations with applications to threshold cryptography | 2016-03-02 | Paper |
| Lower bounds for randomized mutual exclusion | 2015-05-07 | Paper |
| Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions | 2013-08-12 | Paper |
| Cryptographic Combinatorial Clock-Proxy Auctions | 2010-01-07 | Paper |
| Security in Communication Networks | 2006-10-10 | Paper |
| Everlasting security in the bounded storage model | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736825 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437491 | 2003-12-02 | Paper |
| Online scheduling of parallel programs on heterogeneous systems with applications to Cilk | 2002-12-01 | Paper |
| Linear-consistency testing. | 2002-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230336 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941830 | 2000-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941847 | 2000-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249338 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263678 | 1999-11-21 | Paper |
| Lower Bounds for Randomized Mutual Exclusion | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4391216 | 1998-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858447 | 1996-11-04 | Paper |
| On Lotteries with Unique Winners | 1995-05-04 | Paper |
| Clock construction in fully asynchronous parallel systems and PRAM simulation | 1995-04-04 | Paper |
| Set systems with no union of cardinality 0 modulo \(m\) | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206385 | 1990-01-01 | Paper |
| Efficient dispersal of information for security, load balancing, and fault tolerance | 1989-01-01 | Paper |
| Maximum matchings in general graphs through randomization | 1989-01-01 | Paper |
| Efficient randomized pattern-matching algorithms | 1987-01-01 | Paper |
| A logic to reason about likelihood | 1987-01-01 | Paper |
| Randomized algorithms in number theory | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741075 | 1985-01-01 | Paper |
| Transaction protection by beacons | 1983-01-01 | Paper |
| N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable | 1982-01-01 | Paper |
| The choice coordination problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957941 | 1982-01-01 | Paper |
| Probabilistic algorithm for testing primality | 1980-01-01 | Paper |
| Probabilistic Algorithms in Finite Fields | 1980-01-01 | Paper |
| Linear disjointness and algebraic complexity | 1980-01-01 | Paper |
| Complexity of computations | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4164569 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162478 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082296 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050144 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4044055 | 1974-01-01 | Paper |
| Proving simultaneous positivity of linear forms | 1972-01-01 | Paper |
| Fast evaluation of polynomials by rational preparation | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074888 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632564 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5638297 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5616162 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628107 | 1970-01-01 | Paper |
| Decidability of Second-Order Theories and Automata on Infinite Trees | 1969-01-01 | Paper |
| Decidability of second-order theories and automata on infinite trees | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5583072 | 1967-01-01 | Paper |
| Decidability and undecidability of extensions of second (first) order theory of (generalized) successor | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5586349 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5586299 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5547563 | 1965-01-01 | Paper |
| Probabilistic automata | 1963-01-01 | Paper |
| Real time computation | 1963-01-01 | Paper |
| Words in the History of a Turing Machine with a Fixed Input | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5528636 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5518351 | 1962-01-01 | Paper |
| Computable Algebra, General Theory and Theory of Computable Fields | 1960-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5526130 | 1960-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5540445 | 1960-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5559245 | 1960-01-01 | Paper |
| An Algorithm for a Minimum Cover of a Graph | 1959-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5541339 | 1959-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5559229 | 1959-01-01 | Paper |
| On recursively enumerable and arithmetic models of set theory | 1959-01-01 | Paper |
| On Codes for Checking Logical Operations | 1959-01-01 | Paper |
| Recursive unsolvability of group theoretic problems | 1958-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3245637 | 1957-01-01 | Paper |
| A note on Helly's theorem | 1955-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5820610 | 1953-01-01 | Paper |
