Jo60: A Modern Computer Algebraist

Celebrating the Research and Influence of Joachim von zur Gathen at 60

Thursday 27 - Saturday 29 May 2010,
at b-it, Bonn, Germany.

The research of Joachim von zur Gathen has spanned many areas of mathematics and computer science, including computational complexity, cryptography, finite fields, and computer algebra. His influence and contributions to these fields has been felt through his many papers, students, collaborators, colleagues and friends.

Please join us in celebrating the rich and ongoing career of our friend and colleague in Bonn, Germany from May 27 - 29, 2010.

Schedule

Please note that there are two parts of the conference with a special flavor:

Thursday afternoon and evening (yellow) is directed towards a broader audience and round up by an evening reception. We expect local fellows here.
Saturday (green): The program on Saturday includes all non-scientific talks, an excursion and a dinner buffet. We expect private guests here.

	Thursday	Friday	Saturday
09⁰⁰-	Arrival	Arrival	Arrival
09³⁰-11⁰⁰	Welcome. Jürgen Gerhard. How Modern Is Computer Algebra? Eric Bach. Problem Reductions in Algorithmic Number Theory.	Gaston Gonnet. 29.5 years of Maple: how many of the design principles of the system paid dividends Arne Storjohann. Inverting Integer and Polynomial Matrices. Amin Shokrollahi. Computer Algebra and Practical Decoding.	Daniel Panario. Counting Polynomials over Finite Fields: Random Properties and Algorithms. Michael Nöcker. Aspects of a Mathematicians Work in the Business World. Mark Giesbrecht. Decomposing for 24 years and counting the collisions.


	Break	Break	Break
11³⁰-13⁰⁰	Peter Bürgisser. Smoothed Analysis of Condition Numbers. Éric Schost. Evaluation, interpolation and multivariate multiplication.	Claus-Peter Schnorr. Average Time Fast SVP and CVP Algorithms for Low Density Lattices and the Factorization of Integers Oded Goldreich. General Cryptographic Protocols: A Brief Survey	Addresses and gift presentations


	Lunch break

		Allan Borodin. Greedy Algorithms and Why Simple Algorithms Can Be Complex. Preda Mihăilescu. Galois theory in algebras over finite fields - applications to the Berlekamp algebra
14³⁰-16⁰⁰	Official opening ceremony.		Excursion You may choose between Arithmeum. Museum "Haus der Geschichte". Rheinaue.
	Volker Strassen. Probability, algorithms and complexity.
	Volker Strassen. Probability, algorithms and complexity.	Boat trip & gathering
	Break
16³⁰-18⁰⁰	Igor Shparlinski. Polynomial Iterations: Algebraic Properties and Applications Erich Kaltofen. The Indomitable Berlekamp/Massey Algorithm.
			17³⁰ Michael Nüsken. Geheime Nachrichten "Zhu gdv ohvhq ndqq, lvw vfkodx!" Oder: wie man ein WLAN-Kabel abhörsicher macht [German] 17³⁰-19⁰⁰ VisKy für alle. Dinner and... ...Party! (incl. rock band :-))

Evening	Reception