Understanding the limits of computation - bounding the geometry around us
PhD defence, Thursday, 29 September 2022. Rasmus Killmann Brogaard Petersen.
During his PhD studies, Rasmus Killmann Brogaard Petersen studied the limits of computation for several fundamental questions within geometry. The studies specialized in proving lower bounds for specific computational problems, i.e., proving that any algorithm trying to solve the problem must use a certain amount of time or space. The questions studied span from string problems (related to biology) to geometric problems such as counting the number of points inside a box (related to database optimization). A new problem related to hierarchy among the categories of data points is given and interesting connections to well-established problems is shown.
The PhD study was completed at Department of Computer Science, Faculty of Technical Sciences, Aarhus University.
This summary was prepared by the PhD student.
Time: Thursday, 29 September 2022 at 15:00
Place: Building 5342, room 333, Department of Computer Science, Aarhus University, Åbogade 34, Aarhus N, 8200.
Title of PhD thesis: A Tale of Twines, Quadrangles and Colorful Hierarchies
Contact information: Rasmus Killmann Brogaard Petersen, e-mail: firstname.lastname@example.org, tel.: +45 22595024
Members of the assessment committee:
Professor, Michael T. Goodrich, Department of Computer Science, University of California Irvine, USA
Associate Professor, Yakov Nekrich, Department of Computer Science, University of Michigan, USA
Professor Susanne Bødker (chair), Department of Computer Science, Aarhus University, Denmark
Associate Professor, Peyman Afshani, Department of Computer Science, Aarhus University, Denmark
Language: The PhD dissertation will be defended in English
The defence is public.
The PhD thesis is available for reading at the Graduate School of Technical Sciences/GSTS,
Jens Baggesens Vej 53, building 5221, 8200 Aarhus N.