Seminar

Please note: This PhD seminar will be given online.

Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Eric Blais

Please note: This PhD seminar will be given online.

Amine Mhedhbi, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Semih Salihoglu

Please note: This seminar will be presented in person in DC 1304 as well as streamed online.

Tomáš Vinař, Department of Applied Informatics
Comenius University in Bratislava, Slovakia

Please note: This seminar will be presented in person in DC 1304 as well as streamed online.

Broňa Brejová, Department of Computer Science
Comenius University in Bratislava, Slovakia

Many successful tools in bioinformatics are based on working with k-mers, substrings of length k of the input sequences. In this talk, we will discuss two less-known areas where k-mers can be used.

Please note: This PhD seminar will be given online.

Aida Sheshbolouki, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor M. Tamer Özsu

Please note: This PhD seminar will be given online.

Edward Eaton, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Douglas Stebila

Please note: This PhD seminar will be given online.

Alister Liao, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Peter van Beek

Please note: This talk will be given online.

Pamela Wisniewski, Associate Professor
Department of Computer Science, University of Central Florida

Please note: This PhD seminar will be given online.

Charupriya Sharma, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Peter van Beek

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.