Bonn-Aachen International Center
for Information Technology

Imprint

cosec

students

science

city life
cosec >students >Special events >Jo60 
bitkey
Account 
Password 
Register?New password?

Joachim von zur Gathen 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

Friday

Saturday

0900-

Arrival

Arrival

Arrival

0930-1100

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

1130-1300

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

1430-1600

Official opening ceremony.

Excursion

You may choose between

 

Volker Strassen. Probability, algorithms and complexity.

Boat trip & gathering

 

Break

1630-1800

Igor Shparlinski. Polynomial Iterations: Algebraic Properties and Applications

Erich Kaltofen. The Indomitable Berlekamp/Massey Algorithm.

1730 Michael Nüsken. Geheime Nachrichten "Zhu gdv ohvhq ndqq, lvw vfkodx!" Oder: wie man ein WLAN-Kabel abhörsicher macht [German]

1730-1900 VisKy für alle.

Dinner and...

...Party! (incl. rock band :-))

Evening

Reception

Imprint, webmaster & more