51st STOC 2019: Phoenix, AZ, USA

Award Papers and More

Discrete Optimization

Planar Graphs Algorithms

Quantum Computing I

Graph Algorithms I

Streaming

Privacy

Graph Algorithms II Distributed/Dynamic

Complexity Theory I Circuits

Quantum Computation II

Property Testing

Constraint Satisfaction

Pseudorandomness / Algorithmic Game Theory

EC Joint Session

Stringology

Algorithmic Statistics

COLT Sister Session ML Foundations

Matrix Methods

Lower Bounds/Metric Algs

ML Foundations II

Cryptography

Algorithms

Graph Algorithms III

Complexity Theory II

Graph Canonization

a service of Schloss Dagstuhl - Leibniz Center for Informatics