Previous Conferences & Workshops

One of the major insights of the ``fixed-parameter tractability’’ (FPT) approach to algorithm design is that, for many NP-hard problems, it is possible to efficiently *shrink* instances which have some underlying simplicity. This preprocessing can...

I will give an introduction to symplectic geometry and Hamiltonian systems and then introduce an invariant called symplectic cohomology. This has many applications in symplectic geometry and has been used a lot especially in the last 5-10 years. I...

We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled provers...

We prove homological mirror symmetry for a smooth Calabi-Yau hypersurface in projective space. In the one-dimensional case, this is the elliptic curve, and our result is related to that of Polishchuk-Zaslow; in the two-dimensional case, it is the K3...