Algorithms and Complexity

The second presentations will be on February 2nd and 9th, according to the following schedule:

February 2nd, 2022:

10:00 : Polynomial multiplication / Quantum Fourier Transform --- Ferdinand Könneker

10:30 : Sort algorithms / Time complexity of different data structures --- Mohamed Genedy

11:00 : GCD algorithms / Factoring polynomials--- David Hares

11:30 : Primality testing / Factoring--- Simon Hasir

 

February 9nd, 2022:

10:00 : Graph algorithms / Network flow problem --- Felix Rausch

Dear Students,

There will be an information session for your second talks of the proseminar on January 5th, 2022, 10:00-10:30 in the same zoom room as usual.

Merry Xmas to all !

 

--------------------------------------------

Short Summary for those who were not present at the meeting:

1) The presentations will take pale on Feb 2nd and Feb 9th (usual room)

2) You need to choose the exact topic you want to address (extension on the topic of your first presentation) and send it to me before Jan 12th by email

3) If you have strong preferences for Feb 2 or Feb 9, let me know so that I can account for it in the schedule

 

Also, due to the unfortunate current situation, it seems preferable to do the presentations virtually rather than in person.

 

The first presentations will be on December 8th and 15th, according to the following schedule:

December 8th, 2021:

10:00 : Computing with Circuits --- Julian Dietz 

10:30 : Randomized / probabilistic algorithms --- Eric Petryka [Cancelled]

11:00 => 10:30 : Sort algorithms  --- Mohamed Genedy

11:30 => 11:00 : Polynomial multiplication --- Ferdinand Könneker

 

December 15th, 2021:

 9:30 : Sort algorithms  --- Mohamed Genedy

10:00 : Graph algorithms --- Felix Rausch

Dear Students,

I would like to remind you that you need to register for the exam of the proseminar, using your HISPOS access.

Please do it as soon as possible and contact studium if there is a difficulty with the registration.

I would like confirmation by email to me once you are registered.

 

Best,

Antoine Joux

Currently, the topics are pre assigned as follows:

Topic A : Computation models --- Unassigned

Topic B : P versus NP  --- Moritz von Zülow

Topic C: Randomized / probabilistic algorithms --- Eric Petryka

Topic D : Interactive proofs  --- Unassigned

Topic E : Sort algorithms  --- Mohamed Genedy

Topic F : Computing with Circuits --- Julian Dietz 

Topic G : Graph algorithms ---  Felix Rausch

Topic H : GCD algorithms --- David Hares

Topic I : Polynomial multiplication --- Ferdinand Könneker

Topic J : Primality testing --- Simon Hasir

 

The final assignation will be done during our meeting on November 3rd, 10-12