## University COVID-19 update

### Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

# Events tagged with Seminar

Monday, September 20, 2021 — 11:03 AM EDT

## Algebraic Graph Theory Seminar - Kate Lorenzen

Title: Spectral Properties of the exponential distance matrix

 Speaker: Kate Lorenzen Affiliation: Linfield University Zoom: Contact Soffia Arnadottir

Abstract:

Given a graph $G$, the exponential distance matrix is defined entry-wise by letting the $(u,v)$-entry be $q^{dist(u,v)}$ where $dist(u,v)$ is the distance between the vertices $u$ and $v$ with the convention that if vertices are in different components, then $q^{dist(u,v)}=0$. We establish several properties of the characteristic polynomial (spectrum) for this matrix and the inertia of some graph families.

Friday, September 24, 2021 — 3:30 PM EDT

## Tutte Colloquium - Tibor Jager

Title: Tightly-Secure Digital Signatures

 Speaker: Tibor Jager Affiliation: University of Wuppertal, Germany Zoom: Please email Emma Watson

Abstract:

This talk will cover two recent results on tightly-secure digital signature schemes from PKC 2021 and ASIACRYPT 2021.

The first part will consider a strong multi-user security definition for signatures with adaptive corruptions of secret keys, discuss its applications, and the technical challenges of constructing signatures with tight security in this setting. Then we will show a quite simple and efficient construction, based on sequential OR-proofs.

Friday, October 1, 2021 — 3:30 PM EDT

## Tutte Colloquium - Stephen Jordan

Title: Quantum information science for combinatorial optimization

 Speaker: Stephen Jordan Affiliation: Microsoft Quantum & University of Maryland Zoom: Please email Emma Watson

Abstract:

Due to input-output bottlenecks, quantum computers are expected to be most applicable to problems for which the quantity of data specifying the instance is small but the computational cost of finding a solution is large. Aside from cryptanalysis and quantum simulation, combinatorial optimization provides some of the best candidates for problems of real-world impact fitting these criteria. Many of these problems are NP-hard and thus unlikely to be solvable on quantum computers with polynomial worst-case time complexity.

### June 2021

S M T W T F S
30
31
1
2
5
6
7
8
9
12
13
14
15
16
19
20
22
23
26
27
29
30
1
2
3
1. 2021 (85)
1. October (1)
2. September (8)
3. August (7)
4. July (10)
5. June (12)
6. May (7)
7. April (9)
8. March (13)
9. February (8)
10. January (10)
2. 2020 (119)
1. December (5)
2. November (12)
3. October (12)
4. September (12)
5. August (11)
6. July (17)
7. June (11)
8. May (6)
9. March (11)
10. February (11)
11. January (11)
3. 2019 (167)
4. 2018 (136)
5. 2017 (103)
6. 2016 (137)
7. 2015 (136)
8. 2014 (88)
9. 2013 (48)
10. 2012 (39)
11. 2011 (36)
12. 2010 (40)
13. 2009 (40)
14. 2008 (39)
15. 2007 (15)