TCS

2023

Reading March -

Reading January -

2022

Correlation bounds against polynomials -

Smaller ACC0 Circuits for Symmetric Functions -

The strength of equality oracles in communication -

List Colouring Trees in Logarithmic Space -

Data Structure Lower Bounds Short Survey -

Sorting Balls and Water: Equivalence and Computational Complexity -

On Reconfiguration Graph of Independent Sets under Token Sliding -

The Composition Complexity of Majority -

An Optimal Algorithm for Certifying Monotone Functions -

2021

Small Circuits Imply Efficient Arthur-Merlin Protocols -

Smaller ACC0 Circuits for Symmetric Functions -

Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error -

Keep that card in mind -

Montone Complexity of Spanning Tree Polynomial Re-visited -

The Space Complexity of Sampling -

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits -

2020

Lower Bounds for Monotone Arithmetic Circuits via Communication Complexity -

A Lower Bound on Determinantal Complexity -

A Short Overview of Communication Complexity for Algorithms Designers (Reading Group) -

2018

Overview over the real $ au$-conjecture -