STCS Colloquium
Approximating a polynomial as a sum of simple polynomials
SNARGs and PPAD Hardness from Sub-exponential LWE
Communication Complexity of Randomness Manipulation
Recovering Causality Graphs from Time Series Data
From Longest Increasing Subsequence to Random Matrices: a story of universality
Bring Down the Walls!: Why this is the right time for Theoreticians and Computer Architects to Talk
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials
Uncovering Algebraic Structures in the MPC Landscape
Finding Sparse Vertex Cuts in Semi-Random Instances
Pages
