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 research paper presentation will take place in DC 3317.

Muhammad Hassan, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shane McIntosh

Reproducible Builds are software builds that generate identical outputs at each invocation. They are important for security, quality assurance and commercial verifiability.

Please note: This master’s thesis presentation will take place online.

Marian Dietz, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Florian Kerschbaum

Please note: This master’s thesis presentation will take place online.

Tümay Özdemir, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Christopher Batty

Please note: This PhD seminar will be given online.

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.

Please note: This master’s thesis presentation will be given in QNC 1201 and online.

Abhishek Anand, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shalev Ben-David

Please note: This master’s thesis presentation will take place online.

Reza Bigdeli, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Anna Lubiw

The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another.

The flip graph is known to have some connectivity properties: