We prove a linear query complexity lower bound for two-sided testing of graph isomorphism in the bounded-degree model.
Specifically, there are constants $d$ and $\varepsilon_0$ such that, for every sufficiently large $n$,
there exists an $n$-vertex graph $H_n$ of maximum degree at most $d$ such that testing isomorphism ... more >>>

We construct explicit hitting set generators for $\mathbb{F}_2$-polynomials in $n$ variables of degree at most $d$ with an almost optimal density, and seed length $O(d \log n+d^2)$, which is optimal for $d = O(\log n)$.

Second, we address large-field hitting set generators. The influential state-of-the-art construction by Guruswami and Xing ... more >>>

Finding good tree code constructions is among the most natural questions in error-correcting codes over the Hamming channel. Unlike the usual setting, where one encodes a single message against adversarial errors, tree codes allow a sender to encode and send a stream, in an online manner, while protecting it from ... more >>>