Events

Youngbin Kim, Master’s candidate
David R. Cheriton School of Computer Science

AbstractServerless architectures organized around loosely-coupled function invocations represent an emerging design for many applications. Recent work mostly focuses on user-facing products and event-driven processing pipelines. 

Abdullah Rashwan, PhD candidate
David R. Cheriton School of Computer Science

Pak Hay Chan, Master’s candidate
David R. Cheriton School of Computer Science

We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two designated vertices $s,t \in V$, and a cost budget $k$.

Taylor Hornby, Master’s candidate
David R. Cheriton School of Computer Science

This thesis contributes to two areas. The first is the study of parallel repetition theorems and concentration bounds for nonlocal games and quantum interactive proofs. 

We make the following contributions:

Saman Barghi, PhD candidate
David R. Cheriton School of Computer Science

Alexi Turcotte, Master’s candidate
David R. Cheriton School of Computer Science

Ellen Arteca, Master’s candidate
David R. Cheriton School of Computer Science

Finn Lidbetter, Master’s candidate
David R. Cheriton School of Computer Science

Let x and y be words. We consider the languages whose words z are those for which the numbers of occurrences of x and y, as subwords of z, are the same (resp., the number of x's is less than the number of y's, resp., is less than or equal). In this talk we will give a necessary and sufficient condition on x and y for these languages to be regular, and we show how to check this condition efficiently. 

Ricardo Salmon, PhD candidate
David R. Cheriton School of Computer Science

Matthew Amy, PhD candidate
David R. Cheriton School of Computer Science