Previous Conferences & Workshops

The Depth First Search (DFS) algorithm is one of the most standard graph exploration algorithms, used normally to find the connected components of an input graph. Though perhaps less popular than its sister algorithm, Breadth First Search (BFS), the...

Fluctuations of the current of one dimensional non equilibrium diffusive systems are well understood. After a short review of the one dimensional results, the talk will try to show that the statistics of these fluctuations are exactly the same in...

Non-equilibrium Dynamics and Random Matrices, 2013-14

Over the past few decades there has been considerable progress in the mathematical analysis of equilbrium statistical mechanics. However, non-equilibrium dynamics is still at early stages of its...

2013 Women and Mathematics Program Week 2

Movie - "N is a Number"

Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known...

In this talk I will describe nondeterministic reductions which yield new direct product theorems (DPTs) for Boolean circuits. In our theorems one assumes that a function F is "mildly hard" against *nondeterministic* circuits of some size s(n) , and...

2013 Women and Mathematics Program Week 1