Kabanets, Valentine

Algorithms and Lower Bounds in Circuit Complexity

Deterministic learning of DNF

Expanders in power law graphs

Hardcore measures, dense models and low complexity approximations

Meta-algorithms versus circuit lower bounds

Recognizability equals definability for partial k-paths