Skip to content

No items available.

Submodular Function Minimization via Continuous Optimization (Klaus 1116E at 11am)

New Algorithms for Matrix Scaling Problems via Second-order Methods and Generalized Laplacian System Solvers (Klaus 1116E at 11am)

Old and new on the stochastic block model (Klaus 1116 E at 11am)

Approximation Schemes for Planar Graphs: A Survey of Methods (Klaus 1116 E at 11am)

Wednesday, March 15, 2017 at 2pm in Marcus 1117

Neural computations for active perception (Marcus Nano 1117 at 2pm)

Turing award winner speaking on March 13, 11am (Klaus 1116)

Ten Steps of EM Suffice for Mixtures of Two Gaussians (Klaus 1116 E at 11am)

Genesis of ETH and SETH (Klaus 1116 E at 11 am)

Using the sum of squares hierarchy to refute random CSPs (Klaus 1116 E at 11am)

Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple (Klaus 1116 E at 11am)

Explicit Two-Source Extractors and Resilient Functions (Klaus 1116 E at 11am)

Geodesic Walks (Klaus 1116E at noon)

Differentially Private Analysis of Graphs (Klaus 1116 E at 11am)

Revisiting Robust Statistics (Klaus 1116 West at 11am)

CMU Distinguished Professor Lenore Blum speaking on Alan Turing and the Other Theory of Computing on Thursday, October 27 at 5pm in Howey Physics L4

Turing Award Winner Manuel Blum speaking on Human Computation with an Application to Passwords on Thursday, October 27 at 11 a.m. in Klaus 1443

10th anniversary celebration of the Algorithms & Randomness Center featuring Jon Kleinberg (Cornell)

Nevanlinna Prize winner Jon Kleinberg speaking on Human Decisions and Machine Predictions (Klaus 1116 at 10 am)

Recent progress on minimizing decomposable submodular functions (Klaus 1116 E at 11am)

Prices, Auctions, and Combinatorial Prophet Inequalities (Klaus 1116 E at 11am)

A Fast and Simple Unbiased Estimator for Network (Un)reliability (Klaus 1116 E at 11am)

Strongly Rayleigh distributions and their Applications in Algorithm Design (Klaus 1116 E at 11am)

Klaus 2100 at 2 pm

Georgia State University: http://www.siam.org/meetings/dm16/index.php

Klaus 1116 West at 1 pm

Talk is at 2 pm instead of 1 pm - Klaus 1116 West

Klaus 1116 East & West - Invited Speakers: Rocco Servedio (Columbia), Aaron Sidford (Microsoft Research), Luca Trevisan (UC Berkeley) and Virginia Vassilevska-Williams (Stanford)

Klaus 1116 East at 1 pm

MIRC 102 A & B at 1 pm

Klaus 1116 East at 11:00 am

Klaus 1116 East at 11 am (Note: different day, time and location)

Marcus 1117 & 1118 at 1 pm (Note: different location)

Klaus 1116 West at 4 pm (Note: different day and time.)

Klaus 1116 East & West at 1 pm

Klaus 2447 at 4 pm (Note: time and location are different than usual)

Title: Life Under the Lens

Nikhil Devanur presents a talk as part of the ARC Colloquium series.

Anup Rao presents a talk as part of the ARC Colloquium series.

Elad Hazan presents a talk as part of the ARC Colloquium series and co-sponsored by the Machine Learning Seminar Series

Seth Pettie presents a talk as part of the ARC Colloquium series.

ARC presents “The Power of Randomness in Computation Workshop,” co-sponsored by the Institute for Mathematics and its Applications (IMA) at the University of Minnesota.

ARC Colloquium: Blair Sullivan

Jamie Morgenstern presents a talk as part of the ARC Colloquium series on Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)

ARC Colloquium: Vitaly Feldman

Peter Winkler will be giving a joint ACR Colloquium and ACO Student Seminar on January 16, 2015 at 1:00 pm in Skiles Room 005. - See more at: http://www.cc.gatech.edu/events/arc-colloquium-and-joint-aco-student-seminar-peter-winkler#sthash.bjAYe3Eq.d

Providing Statistical Guarantees for Topological Summaries of Data

How “Quantum” is the D-Wave Machine?

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.

A Faster Algorithm for Linear Programming

Efficient Density Estimation via Piecewise Polynomial Approximation

On-line Approach to Off-line Graph Coloring Problems

The Knuth Prize Lecture: The Stories Behind the Results

Distributed Algorithmic Foundations of Dynamic Networks

Maximum Entropy Summary Trees

Samuel Fiorini will give a talk at the ARC Seminar

A Tale of Two Join Algorithms

Electronic Voting using the Split Value Representation

Practically Efficient ZKPs for Preventing Collusion in Auctions

The Big Data Theory and Randomized Algorithms

CSPs, Approximation Resistance, and Optimization Hierarchies

Tatonnement Beyond Gross Substitutes? Gradient Descent to the Rescue

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

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

Ricardo Restrepo presents a talk as part of the ARC Colloquium series.

Is Machine Learning Tractable? --- Three Vignettes

Extended formulations and complexity of polytopes

Algorithms for Geometric Similarity

Flag Algebras

Tensor Decompositions for Learning Latent Variable Models

Diameter of Polyhedra: Abstractions, new upper bounds and open problems

Optimal queue-size scaling in switched networks

The Simple Economics of Approximately Optimal Auctions

A Kernel-Based Combinatorial Auction

Competitive Routing on a Variant of the Delaunay Triangulation

Multidimensional Revenue Optimization

An Additive Combinatorics Approach to the Study of the Log-rank Conjecture in Communication Complexity

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars

Which Networks are Least Susceptible to Cascading Failures?

A Lemke-Type Algorithm for Market Equilibrium Under Separable, Piecewise-Linear Concave Utilities

On r-colorability of random hypergraphs

The power and weakness of randomness (when you are short on time)

Bounds on complexity of SQ learning and evolvability

Randomized Algorithms for Cuts and Colourings

Title: Graph Sparsifiers: A Survey

Approximating Graphic TSP by Matchings

The Laplacian Paradigm: Emerging Algorithms for Massive Graphs

New applications of semidefinite programming: Discrete geometry and harmonic analysis

Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses

Georgia Tech Algorithm and Randomness Center 266 Ferst Drive NW Atlanta, GA 30332-0765 Phone: 404-385-6440