Category Talks

New Algorithms and Lower Bounds in Distributed Computing

Algorithmic and Hardness Results for the Colorful Components Problems

Beyond declarative data cleaning

Can Modalities Save Naive Set Theory?

Dynamic Programming for Lazy Bastards

The Linearization of Pairwise Markov Random Fields

From Pointers to List Containers

Saturation-based incremental LTL model checking with inductive proofs

Welfare Maximization with Friends-of-Friends Network Externalities

The Logic of Counting Query Answers: A Study via Existential Positive Queries