Hat mitgewirkt an:
-
Primality testing in polynomial time : from randomized algorithms to "Primes is in P"
-
On randomness in Hash functions
-
Lower bounds on computation time for various models in computational complexity theory
-
Probabilistic methods in the design and analysis of algorithms : 07391 abstracts collection ; Dagstuhl seminar