Forum 2013 - Final Program Overview

Please click on the slots for further details.

Please note that this event is upon invitation only. Lectures of participating Laureates will be live-streamed on this page during HLF 2013.

Main meeting venue: Heidelberg University on University Square, 69117 Heidelberg.
To venues/locations not within walking distance from Heidelberg University Square, free transport will be provided.

09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00

Videos

  • Heidelberg Laureate Forum

    Heidelberg Laureate Forum

    Slow math

    When, in his HLF opening speech, Klaus Tschira recounted his experiences with a particularly speedy lecturer, I felt reminded of my own time as a student. In Tschira's case, there was a lecturer who had the uncanny ability of writing each equation from the left and from the right simultaneously, finishing with the connecting "=" in the middle. My own recollection is, admittedly, tied up with old technology. This was back in the days when overhead projectors were common. Some... Read more (more)

  • Heidelberg Laureate Forum

    Heidelberg Laureate Forum

    Studying algorithms to study problems

    Nevanlinna Prize winner Daniel Spielman mentioned in an interview that he wants to tell people about the following philosophical ideas. One thing I want to explain is why theoretical computer scientists look like mathematicians. And to a large degree, the reason is that we're trying to make algorithms that we can prove are correct. But more than that, when we study algorithms, I say we're not really studying algorithms, we're usually studying problems. To be able to design an algorithm... Read more (more)

  • Heidelberg Laureate Forum

    Heidelberg Laureate Forum

    What is smoothed analysis?

    Daniel Spielman won the Rolf Nevanlinna Prize in 2010 "for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing." In our interview I asked him to explain smoothed analysis. DS: A lot of my time I spend trying to analyze algorithms, and when we do analysis of algorithms in the theoretical computer science community we like to say things like "this algorithm will always run in less than so much time." And... Read more (more)

  • Heidelberg Laureate Forum

    Heidelberg Laureate Forum

    Mental cryptography and good passwords

    Good passwords are hard to remember. A pattern that makes a password memorable is likely to make it vulnerable to attack. If remembering one secure password is hard, remembering many such passwords is entirely impractical. So people who have gone to the effort of creating one good password use it for many different accounts. A security breach anywhere that password is used means that the password is vulnerable everywhere else it is used. It is much safer to have different... Read more (more)

  • Heidelberg Laureate Forum

    Heidelberg Laureate Forum

    10 inspiring quotes from the #HLF14 opening program

    Anna Valmero, participant #hlf14: The opening program offered a glimpse of the promising lectures from this year’s event and the celebration of a new tradition that will cement the fruitful exchange of knowledge and meaningful dialogue among senior and young experts. Here’s a recap of the inspiring quotes and some challenges posed by the speakers:   1. Speak understandably. If you talk about something not yet known, it is highly advisable to speak slowly. - Dr. Klaus Tschira, chairperson Heidelberg... Read more (more)