Previous Conferences & Workshops

We present a novel way of sparsifying a piece of a graph with very few edges. Our results imply the existence of optimal ultrasparsifiers and efficient approximation algorithms with good approximation guarantee for maximizing the algebraic...

In this talk, we present some new results on the joint distribution function of the argument and the norm of the Riemann zeta function on the 1-line (the edge of the critical strip). Our strategy is to introduce a probabilistic random model for...

The general adversary bound is a lower bound on the number of input queries required for a quantum algorithm to evaluate a boolean function. We show that this lower bound is in fact tight, up to a logarithmic factor. The proof is based on span...

First I will present a geometric method, due to Kazhdan, of approximating representation theory of reductive groups over local fields of positive characteristic (like F_p(t)) with representation theory of reductive groups over local fields of zero...

A natural topology can be given to the space of algebraic cycles over an algebraic variety. By taking homotopy groups of this space, one yields homology-like invariants of the variety, called Lawson homology groups. I will talk about their...