Georgia Institute of Technology Georgia Tech Algorithm and Randomness Center (ARC)

ARC Colloquium: Brittany Terese Fasy–Tulane University

Providing Statistical Guarantees for Topological Summaries of Data

ARC Colloquium and ACO Student Seminar: Umesh Vazirani - U. C. Berkeley

How “Quantum” is the D-Wave Machine?

ARC Colloquium And Machine Learning (ML) Seminar Series with Geoffrey Hinton

Dr. Geoffrey Hinton, Distinguished Professor at the University of Toronto and Distinguished Researcher for Google, will present a video seminar on the history of deep learning.

$0.00

ARC Colloquium: YinTat Lee - Massachusetts Institute of Technology

A Faster Algorithm for Linear Programming

$0.00

ARC Colloquium: Siu On Chan - Microsoft Research

Efficient Density Estimation via Piecewise Polynomial Approximation

ARC Colloquium: Bartosz Walczak - School of Mathematics, Georgia Tech

On-line Approach to Off-line Graph Coloring Problems

ARC Colloquium: Dick Lipton - School of Computer Science, Georgia Tech

The Knuth Prize Lecture: The Stories Behind the Results

ARC Colloquium: Gopal Pandurangan - Brown University (RI) and NTU, Singapore

Distributed Algorithmic Foundations of Dynamic Networks

ARC Colloquium: Howard Karloff - Yahoo Labs

Maximum Entropy Summary Trees

ARC Seminar/DOS: Samuel Fiorini - Université libre de Brussels (Brussels, Belgium).

Samuel Fiorini will give a talk at the ARC Seminar

ARC Colloquium: Atri Rudra - University at Buffalo, SUNY

A Tale of Two Join Algorithms

ARC Colloquium: Michael O. Rabin, Harvard University, Columbia University

Electronic Voting using the Split Value Representation

ARC Colloquium: Michael O. Rabin, Harvard University, Columbia University

Practically Efficient ZKPs for Preventing Collusion in Auctions

ARC Colloquium: Grigory Yaroslavtsev, Brown University

The Big Data Theory and Randomized Algorithms

ARC Colloquium: Pratik Worah - New York University

CSPs, Approximation Resistance, and Optimization Hierarchies

ARC Colloquium: CHEUNG Yun Kuen - New York University

Tatonnement Beyond Gross Substitutes? Gradient Descent to the Rescue

ARC Colloquium: Marco Molinaro - School of Industrial & Systems Engineering at Georgia Tech.

Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching

ARC Colloquium: Piyush Srivastava - UC Berkeley

Zeros of polynomials and the computational complexity of problems in statistical physics