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:
Tuesday, April 26, 2022 2:00 pm - 2:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Systems and Networking • A Two-Tier Storage Interface for Low-Latency Kubernetes Deployments

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

Teodor Alexandru Ionita, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Martin Karsten

Wednesday, April 27, 2022 10:00 am - 10:00 am EDT (GMT -04:00)

Master’s Thesis Presentation • Cryptography, Security and Privacy (CrySP) • Improved Model Poisoning Attacks and Defenses on Federated Learning with Clustering

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

Xinda Li, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Florian Kerschbaum

Wednesday, April 27, 2022 10:30 am - 10:30 am EDT (GMT -04:00)

Master’s Research Paper Presentation • Data Systems • Packed Memory Arrays using Jacobson Index

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

Tamal Adhikary, Master’s candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Khuzaima Daudjee, Semih Salihoglu

Wednesday, April 27, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity • Worst-Case to Average-Case Reductions via Additive Combinatorics

Please note: This seminar will be given online.

Vahid Asadi, PhD candidate
David R. Cheriton School of Computer Science

We present a new framework for designing worst-case to average-case reductions. For a large class of problems, it provides an explicit transformation of algorithms running in time T that are only correct on a small (subconstant) fraction of their inputs into algorithms running in time O(T \log T) that are correct on all inputs.

Friday, April 29, 2022 11:00 am - 11:00 am EDT (GMT -04:00)

Master’s Thesis Presentation • Computer Algebra | Symbolic Computation • Fast Algorithms for Sparse Decomposition and Sparse Series Solutions to Differential Equations

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

Saiyue Lyu, Master’s candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Mark Giesbrecht, Arne Storjohann

Friday, April 29, 2022 12:00 pm - 12:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Software Engineering • JITGNN: A Deep Graph Neural Network for Just-In-Time Bug Prediction

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

Hossein Keshavarz, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Mei Nagappan

Tuesday, May 3, 2022 11:00 am - 11:00 am EDT (GMT -04:00)

Master’s Thesis Presentation • Cryptography, Security, and Privacy (CrySP) • Lox: Protecting the Social Graph in Tor Bridge Distribution

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

Lindsey Tulloch, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Goldberg

Wednesday, May 4, 2022 12:00 pm - 12:00 pm EDT (GMT -04:00)

Master’s Thesis Presentation • Quantum Computing • A Generalized Adversary Method for Quantum Query Complexity

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

Rory Soiffer, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shalev Ben-David

Quantum query complexity measures the minimum number of queries a quantum algorithm needs to make to some input string to compute a function of that input. Query complexity models are widely used throughout quantum computing, from setting limits on quantum algorithms to analyzing post-quantum cryptography.