Algorithms
The Emerging Theory of Algorithmic Fairness
As algorithms reach ever more deeply into our daily lives, increasing concern that they be “fair” has resulted in an explosion of research in the theory and machine learning communities. This talk surveys key results…
Compressing human text.
I will present a new data compression algorithm that compresses human text more effectively than all current variants of PPM, CTW, DMC, LZ (Lempel-Ziv), LZMA, CSE and BWT. It uses a hierarchical non-parametric sequence model…
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of…
Logic, Co-induction and Infinite Computation
Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations. Where induction corresponds to least fixed points semantics, co-induction corresponds to greatest fixed point semantics. In this talk…
Planar Graph Perfect Matching is in NC
Is matching in NC, i.e., is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in TCS for over three decades, ever since the discovery of Random NC matching…
Distributive Lattices, Stable Matchings, and Robust Solutions
Our results are: ** Introduce the problem of finding stable matchings that are robust to errors in the input. ** An efficient algorithm for the following class of errors: Permute arbitrarily the preference list of…
