Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:

Please note: This master’s thesis presentation will be given online.

Egill Gudmundsson, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Olga Vechtomova

Please note: This DSG Seminar Series talk will be given online.

David Doermann
Department of Computer Science and Engineering
School of Engineering and Applied Sciences
Institute for Artificial Intelligence
University at Buffalo

Please note: This PhD seminar will be given online.

Thierry Delisle, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Peter Buhr

What is the polite way for computer programs to procrastinate?

Postponing work politely means not preventing the progress of others, which requires taking turns letting others make eventual progress. When this happens quickly, there is the illusion of simultaneity and possibly real simultaneity.

Please note: This master’s thesis presentation will be given online.

Elliot Nelson, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Pascal Poupart

Friday, January 21, 2022 9:00 am - 9:00 am EST (GMT -05:00)

PhD Defence • Algorithms and Complexity • Related Orderings of AT-Free Graphs

Please note: This PhD defence will be given online.

Jan Gorzny, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Jonathan Buss

An asteroidal triple (AT) is a triple of independent vertices x, y, z such that between every pair of vertices in the triple, there is a path that does not intersect the closed neighbourhood of the third. A graph without an asteroidal triple is said to be AT-free.