Previous Conferences & Workshops

May
10
2007

Joint IAS/Princeton University Number Theory Seminar

The Existence of Bessel Functionals
Ramin-Takloo-Bighash
4:30pm|Fine Hall 322, Princeton University

In this talk I will discuss some recent results on the existence of certain unique models related to the Gross-Prasad conjecture. This is joint with Dipendra Prasad.

May
08
2007

Computer Science/Discrete Mathematics Seminar II

An Exponential Time/Space Speedup for Resolution
10:30am|S-101

This is joint work with Philipp Hertel Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experimental design, planning and...

May
07
2007

Computer Science/Discrete Mathematics Seminar I

Reachability Problems: An Update
Eric Allender
11:15am|S-101

We study the complexity of restricted versions of st-connectivity, which is the standard complete problem for NL. Grid graphs are a useful tool in this regard, since * reachability on grid graphs is logspace-equivalent to reachability in general...

May
01
2007

Computer Science/Discrete Mathematics Seminar II

One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
10:30am|S-101

In this talk we study the one-way multi-party communication model, in which each of the k parties speaks exactly once in its turn. For every fixed k, we prove a tight lower bound of Omega(n^(1/(k-1))) on the probabilistic communication complexity of...

Apr
30
2007

Computer Science/Discrete Mathematics Seminar I

History of the Theory of Error-Correcting Codes
Elwyn Berlekamp
11:15am|S-101

This subject began in the late 1940s with the opus of Shannon [1948] and the short papers of Hamming [1950] and Golay [1949], followed a decade later by the powerful constructions of Bose-Chaudhuri-Hocquenghem and Reed-Solomon. A variety of...

Apr
26
2007

Joint IAS/Princeton University Number Theory Seminar

A Product Theorem in (Virtually) Free Groups
4:30pm|Princeton University; Fine Hall 322

In inverse problems in arithmetic combinatorics, one is interested in describing internal properties of those finite subsets $A$ of an algebraic structure that ``barely expand'' under its operations. One of the deepest results in the area is Freiman...

Apr
24
2007

Computer Science/Discrete Mathematics Seminar II

Consensus Clustering, Hieraracical Clustering and Phylogeny
10:30am|S-101

Consensus clustering is the problem of aggregating a list of clusterings of ground data into one clustering. I will present new approximation algorithms for this problem, building on techniques used for ranking problems (described in my previous...

Apr
23
2007

Computer Science/Discrete Mathematics Seminar I

Disigning Efficient Program Checkers by Delegating Their Work
11:15am|S-101

Program checking, program self-correcting and program self-testing were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain confidence in software, by considering program correctness on an input by...

Apr
19
2007

Joint IAS/Princeton University Number Theory Seminar

On a Conjecture of Greenberg on Iwasawa Invariants of Totally Real Number Fields
4:30pm|S-101

We show that Leopoldt's conjecture for totally real number fields implies Greenberg's conjecture on the uniform boundedness of the $p$-primary part of the class groups of the finite extensions along the cyclotomic tower of a totally real number...