Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 30, 2021, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Ulysse Schaller

The Symmetric Rendezvous Problem

Two friends have agreed to meet up in the Mozart café in Vienna on a given day. However, once they arrive in Vienna they realize that there are actually n different Mozart cafés in the city. They want to meet as quickly as possible, but they have no mean of communication and have not agreed on a meeting-strategy in advance. This is the so-called symmetric rendezvous problem (on discrete locations). Although it is extremely simple to state, the optimal strategy is still unknown, even for n=5 for example. In this Mittagseminar, I will talk about what is known and what remains open for this problem.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login