The notion of pseudo-randomness plays a very crucial role for (quasi-)Monte Carlo methods
but also in cryptography. For both applications, number theoretic constructions of high
quality pseudo-random number generators using finite fields have been very successful.
Finite fields are also of great importance in modern applications such as analysis of
algorithms, information and communication theory, signal processing and coding theory.
A tutorial on some of the main topics of the workshop will be given by Arne Winterhof:
"Applications of Number Theory"
The tutorial consists of a survey talk given on Tuesday, Oct. 23 (Time TBA), followed by
lectures every Thursday, 13:45-15:15, and exercise courses every Tuesday, 11:00-11:45.
Location of Survey talk: RICAM, Room SP2 416-2,
Location of lectures and exercise courses: TBA.
Marco Buratti (University of Perugia)
Jim Davis (University of Richmond)
Daniel Katz (California State University)
Gohar Kyureghyan (University of Rostock)
Subhamoy Maitra (Indian Statistical Institute Kolkata)
Christian Mauduit (Université d'Aix-Marseille)
Wilfried Meidl (RICAM)
Laszlo Merai (RICAM)
Giacomo Micheli (University of Oxford)
Daniel Panario (Carleton University)
Giorgis Petridis (University of Georgia)
Joel Rivat (Université d'Aix-Marseille)
Oliver Roche-Newton (RICAM)
Joachim Rosenthal (Universität Zürich)
Misha Rudnev (University of Bristol)
András Sárközy (Eötvös Loránd University Budapest)
Bernhard Schmidt (Nanyang Technological University Singapore)
John Sheekey (University College Dublin)
Cathy Swaenepoel (Aix-Marseille Université)
Alev Topuzoğlu (Sabanci University Istanbul)
Koen van Greevenbroek (University Bonn)
Qiang Wang (Carleton University)
Alfred Wassermann (University of Bayreuth)
Qing Xiang (University of Delaware)
Yue Zhou (National University of Defense Technology Changsha)