Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
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:
Friday, June 6, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Juan Vera

Random colorings of graphs

Speaker: Juan Vera
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We consider the problem of generating a colouring of the graph G uniformly at random using a natural Markov chain algorithm: the Glauber dynamics.

Friday, June 13, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Berkant Ustaoglu

Key establishment - goals, security arguments and applications

Speaker: Berkant Ustaoglu
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

This talk will be an overview of key establishment. We will begin by discussing the importance of key establishment protocols and consider what a protocol needs to achieve.

Friday, June 20, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Geoff Whittle

Matroid representation over the reals

Speaker: Geoff Whittle
Affiliation: Victoria University of Wellington
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Traditionally interest in matroid representation theory has focussed on finite fields. But why not consider infinite fields, in particular the real numbers? Probably the reason for the neglect is that the news is pretty bad.

Friday, June 27, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Penny Haxell

Scarf's Lemma and the Stable Paths Problem

Speaker: Penny Haxell
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We address a question in graphs called the stable paths problem, which is an abstraction of a network routing problem concerning the Border Gateway Protocol (BGP). The main tool we use is Scarf's Lemma.

Friday, July 4, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Henry Wolkowicz

Duality, Complementarity, and Regularization, in Conic Convex Optimization

Speaker: Henry Wolkowicz
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The elegant results for strong duality and strict complementarity for linear programming (LP) can fail for cone programming over nonpolyhedral cones.

Friday, July 11, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Bert Gerards

On the structure of binary matroids

Speaker: Bert Gerards
Affiliation: CWI, Netherlands
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Given a separable strongly self-concordant function $f:\R^n \rightarrow \R$, we show the associated spectral function $F(X)= (f \circ \lambda)(X)$ is also strongly self-concordant function.

Friday, July 18, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Andrew Childs

One-More Discrete Logarithm Problems

Speaker: Andrew Childs
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Given an undirected graph G, the continuous-time quantum walk on G is defined as the solution of the Schrodinger equation with the Hamiltonian given by the adjacency matrix of G.

Friday, July 25, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte Seminar - Alfred Menezes

One-More Discrete Logarithm Problems

Speaker: Alfred Menezes
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

There are many issues that arise in interpreting reductionist proofs of security of cryptographic protocols. I will consider the case of security proofs that rely on the hardness of non-standard one-more discrete logarithm and Diffie-Hellman problems.

Friday, August 1, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jacques Verstraete

On the structure of binary matroids

Speaker: Jacques Verstraete
Affiliation: University of California, San Diego
Room: Mathematics & Computer Building (MC) 5158

Abstract:

An old conjecture Erdős states that every graph of minimum degree three has a cycle of length a power of two.

Friday, August 22, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Dimitar Jetchev

Bit Security of Elliptic Curve Diffie-Hellman Secret Keys

Speaker: Dimitar Jetchev
Affiliation: Institut des Hautes Études Scientifiques
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We show that if one can predict the least significant bit of the Diffie-Hellman secret keys for elliptic curves with non-negligible advantage on a polynomial fraction of all curves over a given finite field $\mathbb{F}