Accepted Papers
Dichotomy Result on 3-Regular Bipartite Non-negative Functions
Approximation algorithms for connectivity augmentation problems
On rooted $k$-connectivity problems in quasi-bipartite digraphs
Real tau-Conjecture for sum-of-squares: A unified approach to lower bound and derandomization
A Generic Convolution Algorithm for Join Operations on Tree Decompositions
Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata
Shelah-Stupp's and Muchnik's Iterations Revisited
On Separation between the Degree of a Boolean Function and the Block Sensitivity
Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
Large clique is hard on average for resolution
A PCP of proximity for Real Algebraic Polynomials
Variants of the Determinant Polynomial and the VP-completeness
A Generalization of a Theorem of Rothschild and van Lint
Upper Bound for Torus Polynomials
Upper Bounds on Communication in terms of Approximate Rank
Dynamic Complexity of Expansion
Approximation and Complexity of the Capacitated Geometric Median Problem
Approximation Schemes for Multiperiod Binary Knapsack Problems
Injective Colouring for H-Free Graphs
Input-driven pushdown automata on well-nested infinite strings
Average-case rigidity lower bounds
On closed-rich words
Predictions and algorithmic statistics for infinite sequences
Bit-Complexity of Systems of Linear Evolutionary Partial Differential Equations
Limitations of Sums of Bounded Read Formulas and ABPs
On the Computational Complexity of Reaction Systems, Revisited (Extended Abstract)
Computational Complexity of Multi-Player Evolutionarily Stable Strategies
A Secure Three-input AND Protocol with a Standard Deck of Minimal Cards