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.

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

Supervisor: Professor Martin Karsten

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

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

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.

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

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

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

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.