Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

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:
Wednesday, August 11, 2021 2:30 pm - 2:30 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Programming Languages • No Zombie Types: Liveness-Based Justification For Monotonic Gradual Types

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

Yangtian Zi, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Gregor Richards

Thursday, August 12, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Algorithms and Complexity • The Complexity of Finding Dense Subgraphs in Graphs with Large Cliques

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

Cameron Seth, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Eric Blais

The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at most d.

Monday, August 16, 2021 1:00 pm - 1:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Algorithms and Complexity • Extremely Fast (a,b)-trees at all Contention Levels

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

Anubhav Srivastava, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Trevor Brown

The ordered dictionary is one of the most fundamental abstract data types. It stores a set of key-value pairs, and supports operations to insert, remove and retrieve key-value pairs. It can also support range query operations.