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 -

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 -

Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT -

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

Lower Bounds in Computational Complexity Boot Camp -

2019

Parity helps to compute majority -

On the Distribution of Runners on a Circle -

Balancing Sets and Majority Lower bounds -

Border Complexity -

2018

Monotone VP vs monotone VNP -

Factoring vs Identity Testing -

ABP general lowerbound -

Overview over the real $ au$-conjecture -

2015

Brothers - In the Nick of Time -

E3 and the Marketing Monster -

Player Disconnect and The Last of Us -

Tomb Raider and the Quick Event of Time -

They Bleed Pixels - The Hardcore Casual Platformer -