Seminar • Algorithms and Complexity • Computability and Complexity in Analytic Combinatorics
Please note: This seminar will take place in DC 1302 and online.
Steve Melczer, Assistant Professor
Department of Combinatorics and Optimization
Steve Melczer, Assistant Professor
Department of Combinatorics and Optimization
Joseph Musleh, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Éric Schost
Anurag Murty Naredla, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Anna Lubiw
In the dispersion problem for ordered intervals, the input is an ordered list of intervals on the real line, and the task is to select one point from each interval, such that the ordering of points along the line respects the given ordering of intervals and such that the points are “far apart” from each other.
Thierry Delisle, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Peter Buhr
Jerry Li, Microsoft Research
Institute for Quantum Computing
Petri Varsa, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Gladimir V. G. Baranoski
Zihao Wang, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lila Kari
Matthew Lakier, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Daniel Vogel
“Easter eggs” are features hidden inside software, and the practice of developers including them is a long-standing global phenomenon. They have seen some investigation in the context of games, but despite their prevalence in non-game software applications, their nature within this context is less clear.
Zihao Wang, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lila Kari
Hannah Bast, Department of Computer Science
Albert-Ludwigs-Universität Freiburg