-
Dec 7
ARC Colloquium: Mihalis Yannakakis, Columbia University
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars
-
Dec 5
ARC Colloquium: Robert Kleinberg, Cornell University
Which Networks are Least Susceptible to Cascading Failures?
-
Dec 1
ARC Colloquium: Ruta Mehta, IIT, Bombay
A Lemke-Type Algorithm for Market Equilibrium Under Separable, Piecewise-Linear Concave Utilities
-
Nov 14
ARC Colloquium: Andrey Kupavskii, Yandex Corporate
On r-colorability of random hypergraphs
-
Nov 11
ARC Theory Day
-
Nov 10
Joint ARC and School of Math Colloquium by Avi Wigderson, Institute for Advanced Study, Princeton
The power and weakness of randomness (when you are short on time)
-
Nov 7
ARC Colloquium: Vitaly Feldman, IBM Research - Almaden
Bounds on complexity of SQ learning and evolvability
Statistical query (SQ) learning (Kearns, 1993) model is a restriction of Valiant's learning model (1984) that models learning from statistical properties of examples rather than from individual examples.
-
Oct 31
ARC Colloquium: David Pritchard, NSERC
Randomized Algorithms for Cuts and Colourings
This is a talk in two parts, linked by probabilistic methods and linear algebra.
-
Oct 26
ARC Colloquium: Nick Harvey, University of British Columbia, CA
Title: Graph Sparsifiers: A Survey
-
Oct 19
ARC Colloquium: Ola Svensson, École polytechnique fédérale de Lausanne EPFL
Approximating Graphic TSP by Matchings
We present a framework for approximating the metric TSP based on a novel use of matchings. -
Oct 3
ARC Colloquium: Shang-Hua Teng, University of Southern California
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
We describe an emerging paradigm, which we refer to as the Laplacian Paradigm, for the design of efficient algorithms for massive graphs. -
Sep 26
ARC Colloquium: Frank Vallentin, Delft Institute of Applied Mathematics
New applications of semidefinite programming: Discrete geometry and harmonic analysis
-
Sep 19
ARC Colloquium: Dieter van Melkebeek, University of Wisconsin - Madison
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
2011 Events
266 Ferst Drive
Atlanta, GA 30332-0765