18 Categories
[Algorithms]1 [Arithmetic Circuits]4 [Boolean Circuit Complexity]4 [Boolean Circuits]2 [C++]1 [Communication Complexity]4 [Data Structures]4 [Django]1 [Games]5 [Graphs]1 [Haskell]1 [Projects]8 [Python]1 [Qt]1 [Rust]6 [TCS]22 [Typescript]1 [Yew]1
Algorithms
Sorting Balls and Water: Equivalence and Computational Complexity -
Arithmetic Circuits
Montone Complexity of Spanning Tree Polynomial Re-visited -
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits -
Lower Bounds for Monotone Arithmetic Circuits via Communication Complexity -
A Lower Bound on Determinantal Complexity -
Boolean Circuit Complexity
The Composition Complexity of Majority -
An Optimal Algorithm for Certifying Monotone Functions -
Small Circuits Imply Efficient Arthur-Merlin Protocols -
Smaller ACC0 Circuits for Symmetric Functions -
Boolean Circuits
Correlation bounds against polynomials -
Smaller ACC0 Circuits for Symmetric Functions -
C++
Communication Complexity
The strength of equality oracles in communication -
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error -
A Short Overview of Communication Complexity for Algorithms Designers (Reading Group) -
Data Structures
List Colouring Trees in Logarithmic Space -
Data Structure Lower Bounds Short Survey -
Django
Games
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 -
Graphs
On Reconfiguration Graph of Independent Sets under Token Sliding -
Haskell
Projects
Automove -
Viola -
Python
Qt
Rust
Automove -
Viola -
TCS
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 -
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 -
Montone Complexity of Spanning Tree Polynomial Re-visited -
The Space Complexity of Sampling -
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits -
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) -
Overview over the real $ au$-conjecture -
Typescript
Yew
Viola -