THIS SITE

Information for

Events

Monday, January 22, 2018 — 9:30 AM EST

Title: Are cryptosystems based on ideal lattices quantum-safe ?

Speaker Jean-Francois Biasse
Affiliation: University of South Florida
Room:  QNC 1501

Abstract:

Shor's algorithm factors RSA integers and solves the Discrete Logarithm Problem (DLP) in quantum polynomial time. Therefore, alternatives to these cryptosystems must be developed to replace the current cryptographic schemes. One of the most interesting family of schemes that have been proposed for the replacement of RSA-based and DLP-based primitives relies on the hardness of finding short vectors in Euclidean lattices.

Wednesday, January 24, 2018 — 9:30 AM EST

Title: Principled algorithms for finding local minima

Speaker: Oliver Hinder
Affiliation: Stanford University
Room: MC 5501

Abstract:

Convex optimization is the cornerstone of continuous optimization, but many real problems are nonconvex: neural networks, airplane design, water network management, etc. This two part talk explores my work developing algorithms for finding local minima of nonconvex functions.

Wednesday, January 24, 2018 — 4:00 PM EST

Title: Reading Seminar "Robust Optimization"

Speaker: Group Reading
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

In this reading seminar, we will go through Section 1. 2-1. 3 of Chapter 1 in the book 'Robust Optimization'

Thursday, January 25, 2018 — 1:30 PM EST

Title: Type-II Matrices

Speaker Chris Godsil
Affiliation: University of Waterloo
Room MC 6486

Abstract:

The Schur product M o N of two matrices M and N is the usual entrywise product. The matrix N is the Schur inverse of M if M o N = J. Denote the Schur inverse of M by M(-). An n x n matrix is a type-II matrix if
WW(-)T = nI.

Friday, January 26, 2018 — 9:30 AM EST

Title: Sparse graphs with forbidden induced subgraphs and the Erdos-Hajnal conjecture

Speaker: Sophie Spirkl
Affiliation: Princeton University
Room: MC 5501

Abstract:

A graph G is called H-free if it does not contain H as an induced subgraph, i.e. H cannot be obtained from G by deleting vertices. A famous conjecture due to Erdos and Hajnal states that for every graph H, there is a constant c > 0 such that in every n-vertex H-free graph G, there is a set of nc vertices that are either all pairwise adjacent or all pairwise non-adjacent.

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