Theory of Computation (TOC) Seminar
 |
Mikkel Thorup: Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time Tuesday, March 17, 2015 - 4:15pm to 5:15pm Abstract
We present a deterministic near-linear time algorithm that computes the edge-connectivity and
finds a minimum cut for a simple undirectedunweighted graph G with n vertices and m edges. |
 |
Two Decades of Property Testing Tuesday, December 9, 2014 - 4:15pm to 5:15pm ABSTRACT: Property Testing studies the design and analysis of algorithms that Test if some (massive) data satisfies some global Property without looking at all the data, or inferring the parameters that explain how the data satisfies the property. |
 |
Alexandr Andoni: Sketching Complexity of Graph Cuts Tuesday, October 14, 2014 - 4:15pm to 5:15pm ABSTRACT: We study the problem of sketching an input graph so that, given the
sketch, one can estimate the value (capacity) of any cut in the graph
up to a small approximation, 1+epsilon. The classic construction of |
Pages
