Previous Conferences & Workshops

I will sketch a proof that for any monotone graph property P and any $\epsilon >0$ one can approximate efficiently the minimum number of edges that have to be deleted from an n-vertex input graph to get a graph that satisfies P, up to an additive...

In this talk, I'd like to describe my recent work with P.Sarnak concerning the equidistribution properties for Hecke igenforms on the modular surface. We evaluate asymptotically the variance for the equidistribution by means of the trace formula and...

Lovasz and Schrijver described a generic method of tightening the LP and SDP relaxation for any 0-1 optimization problem. These tightened relaxations were the basis of several celebrated approximation algorithms (such as for MAX-CUT, MAX-3SAT, and...

For a number field K and a (compact) p-adic Lie groups G, the inverse Galois problem asks whether G can be realized as the Galois group of an extension of K. Already in the case that G is zero-dimensional, this is too difficult. So I propose to...

A randomness extractor is an algorithm which extracts randomness from a low-quality random source, using some additional truly random bits. Extractors have proved useful in a variety of seemingly unrelated areas. We construct new extractors which...

We study the following problem regarding quadratic programs: Given a quadratic polynomial \sum a_{xy} xy, where all a_{xx} = 0, find a -1,+1 assignment to its variables that maximizes it. This problem recently attracted attention due to its...

It will be on some constructions in the candidate category of mixed Tate Motives constructed by Bloch and Kriz.

A ranking of n web pages is to be chosen from outputs of k search engines. How do we choose one ranking minimizing the "disagreement" with the k rankings? A clustering of n genes is to be chosen from outputs of k clustering algorithms. How do we...