The Chasm at Depth Four, and Tensor Rank : Old results, new insights
Space-efficient Approximation Scheme for Maximum Matching in Sparse Graphs
Color Coding-Related Techniques
Hardness of multiple choice problems
Unbounded Error Communication Complexity of XOR Functions
Efficiently decoding Reed-Muller codes from random errors
Alternate Parameterizations
Solving connectivity problems via basic Linear Algebra
Isolation Lemma for Directed Reachability and NL vs. L
Dynamic Parameterized Problems - Algorithms and Complexity
A Quest for Subexponential Time Parameterized Algorithms for Planar-k-Path: From Undirected to Directed
Complexity Classes and the Graph Isomorphism Problem