FOCS-ACO: Abstracts

FOCS50 & ACO20
Theory Day

Celebrating
50th Anniversary of Foundations of Computer Science and
20th Anniversary of Algorithms, Combinatorics, and Optimization Program at Georgia Tech


October 24, 2009
LeCraw Auditorium, Georgia Tech Campus, Atlanta, GA

Poster Presentations

Arash Asadi, Luke Postle, Robin Thomas Sup-exponentially many 3-colorings of triangle-free planar graphs
Alexandra Boldyreva, Nathan Chenette, Younho Lee, Adam O'Neill Order-Preserving Symmetric Encryption
Karthekeyan Chandrasekaran Efficient Deterministic Algorithm for Lovasz Local Lemma
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala Uniform Sampling & Isoperimetric Inequalities for Star Shaped Bodies
Sourav Chakraborty, Nikhil Devanur and Chinmay Karande Market Equilibrium with Transaction Costs
Subrahmanyam Kalyanasundaram, Richard Lipton, and Farbod Shokrieh Simulating Nondeterminism using Deterministic Machines
Amanda Pascoe and Dana Randall Convergence rates of heterogeneous self-assembly models
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali Distributed Random Walks Computation
Atish Das Sarma, Ashwin Lall, Richard J Lipton, Danupon Nanongkai, Jun Xu Skyline Computation in Database System
Dan Steffy and William Cook Methods for Exact Precision Linear and Integer Programming
Kael Stilp and Ozlem Ergun The Integrality Gap and Efficient Frontier for Network Interdiction
Noah Streib, Mitch Keller and Tom Trotter Online Algorithms for the Linear Discrepancy of a Poset
Prasad Tetali, Juan Vera, Eric Vigoda, Linji Yang Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees
Pushkar Tripathi and Lei Wang Approximability of Submodular Combinatorial Optimization Problems
Steve Tyber and Ellis L. Johnson A Polyhedral Study of the Mixed Integer Cut
Carl Yerger and Ken-ichi Kawarabayashi A short proof for color-critical graphs on surfaces

Back