|
11 |
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation
Berlin, Heidelberg : Springer Berlin Heidelberg, 2011
|
|
|
|
12 |
Approximating average parameters of graphs
[Wadern] : [Internat. Begegnungs- und Forschungszentrum für Informatik], [2006]
|
|
|
|
13 |
Contemplations on testing graph properties
[Wadern] : [Internat. Begegnungs- und Forschungszentrum für Informatik], [2006]
|
|
|
|
14 |
Theoretical computer science
Berlin : Springer, 2006
|
|
|
15 |
On interactive proofs with a laconic prover
Enthalten in Computational complexity Bd. 11, Nr. 1-2, date:6.2002: 1-53
|
|
|
|
16 |
Testing Monotonicity
Enthalten in Combinatorica Bd. 20, Nr. 3, date:3.2000: 301-337
|
|
|
|
17 |
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, Oded. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1999
|
|
|
|
18 |
A uniform-complexity treatment of encryption and zero-knowledge
Enthalten in Journal of cryptology Bd. 6, Nr. 1, date:03.1993: 21-53
|
|
|
|
19 |
Randomness in interactive proofs
Enthalten in Computational complexity Bd. 3, Nr. 4, date:12.1993: 319-354
|
|
|
|
20 |
On the complexity of computation in the presence of link failures: the case of a ring
Enthalten in Distributed computing Bd. 5, Nr. 3, date:12.1991: 121-131
|
|
Administration
