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, May 12, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Xavier Goaoc (Université de Lorraine)

Limits of order types

The talk was recorded. Use the following link to access it: https://ethz.zoom.us/rec/share/7uZcAZaq6GVIEqfqyULtZ5E_MojCeaa8hnQW-PAMnh2_hr73DHRBwRN1aF2ENnk_

Order types are combinatorial structures that encode some properties of finite point sets. In this talk, I will report on an effort to study order types through some of the methods developed for limits of dense graphs. Joint work with Alfredo Hubard, Rémi de Joannis de Verclos, Jean Sébastien Sereni and Jan Volec. Preprint available from https://hal.archives-ouvertes.fr/hal-01913144


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