Previous Conferences & Workshops

We present approximation algorithms for the maximum constraint satisfaction problem with k variables in each constraint (MAX k-CSP). Given a (1-epsilon) satisfiable 2CSP our first algorithm finds an assignment of variables satisfying a 1 - O(sqrt...

A conjecture of Lang (on elliptic curves) generalized by Silverman on abelian varieties predicts that the Neron-Tate height of a point on an abelian variety should grow at least like the height of the variety itself. We shall suggest higher...

Although equivariant cohomology originated -- at this Institute -- nearly half a century ago, only much more recently has it become an active area of algebraic geometry. The equivariant cohomology rings of simple algebraic varieties such as...

Although equivariant cohomology originated -- at this Institute -- nearly half a century ago, only much more recently has it become an active area of algebraic geometry. The equivariant cohomology rings of simple algebraic varieties such as...

In part I of this talk, we began a discussion of "simple algorithms" and restricted our attention to the priority algorithm model which models ``greedy-like'' algorithms. In Part II of this talk, we will extend the priority algorithm framework to...

Although equivariant cohomology originated -- at this Institute -- nearly half a century ago, only much more recently has it become an active area of algebraic geometry. The equivariant cohomology rings of simple algebraic varieties such as...

The Internet is an indispensable part of our information society, and yet its basic foundations remain vulnerable to simple attacks, and one area that remains especially susceptible to attack is routing. There have been increasing efforts in the...