Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. - Ludmila Glinskih; Dmitry Itsykson (MFCS, 2017)

On Tseitin formulas, read-once branching programs and treewidth. - Ludmila Glinskih; Dmitry Itsykson (Electron. Colloquium Comput. Complex., 2019)

The Complexity of Verifying Boolean Programs as Differentially Private. - Mark Bun; Marco Gaboardi; Ludmila Glinskih (CSF, 2022)

MCSP is Hard for Read-Once Nondeterministic Branching Programs. - Ludmila Glinskih; Artur Riazanov (LATIN, 2022)

Partial Minimum Branching Program Size Problem is ETH-hard. - Ludmila Glinskih; Artur Riazanov (Electron. Colloquium Comput. Complex., 2024)