Primality testing in polynomial time : from randomized algorithms to "PRIMES is in P". - Berlin : Springer, 2004. - Online-Ressource (X, 147p. Also available online). - (Lecture notes in computer science ; 3000) ISBN 978-3-540-25933-6
This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite. The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digits needed to write n, are important for theoretical computer science and for applications in algorithmics and cryptology. This book gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal, and Saxena. The textbook is written for students of computer science, in particular for those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study
https://doi.org/10.1007/b12334
Gossiping and broadcasting versus computing functions in networks. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 137 (2004), 2, S. 127-153
https://doi.org/10.1016/S0166-218X(03)00257-9
The analysis of a recombinative hill-climber on H-IFF. - In: IEEE transactions on evolutionary computation, ISSN 1089-778X, Bd. 7 (2003), 5, S. 417-423
Almost random graphs with simple hash functions. - In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, (2003), S. 629-638
A case against using Stirling's formula. - In: Bulletin of the European Association for Theoretical Computer Science, EATCS, ISSN 0252-9742, Bd. 80 (2003), S. 153-158
On the probability of rendezvous in graphs. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003. - 27 S. - (Forschungsberichte des Max-Planck-Instituts für Informatik ; 2003-1-006)
Almost random graphs with simple hash functions. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003. - 20 S. - (Forschungsberichte des Max-Planck-Instituts für Informatik ; 2003-1-005)
The probability of a rendezvous is minimal in complete graphs. - In: Algorithms and Computation, (2002), S. 55-66
http://dx.doi.org/10.1007/3-540-36136-7_6
The analysis of a recombinative hill climber on HIFF. - Dortmund : Secretary of the SFB 531, 2002. - 6 Bl. - (Reihe computational intelligence ; 138)
Simple minimal perfect hashing in less space. - In: Algorithms — ESA 2001, (2001), S. 109-120
http://dx.doi.org/10.1007/3-540-44676-1_9