Bounded-depth Frege complexity of Tseitin formulas for all graphs. - Nicola Galesi; Dmitry Itsykson; Artur Riazanov; Anastasia Sofronova (Electron. Colloquium Comput. Complex., 2019)

Branching Programs with Bounded Repetitions and Flow Formulas. - Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2021)

A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates. - Ivan Mihajlin; Anastasia Sofronova (CCC, 2022)

A better-than-3logn depth lower bound for De Morgan formulas with restrictions on top gates. - Ivan Mihajlin; Anastasia Sofronova (Electron. Colloquium Comput. Complex., 2022)

A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion. - Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2022)

Top-Down Lower Bounds for Depth-Four Circuits. - Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion. - Anastasia Sofronova; Dmitry Sokolov 001 (CCC, 2025)

Monotone Circuit Complexity of Matching. - Bruno Pasqualotto Cavalar; Mika Göös; Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)

Searching for Falsified Clause in Random log{n}-CNFs is Hard for Randomized Communication. - Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2025)

Lower Bounds Beyond DNF of Parities. - Artur Riazanov; Anastasia Sofronova; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2025)