Ludmila Glinskih

11 papers A 2B 2Misc 1Journal 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Fast Agnostic Learners in the Plane.
CoRR
Talya Eden, Ludmila Glinskih, Sofya Raskhodnikova
2025 A conf
Partial Minimum Branching Program Size Problem Is ETH-Hard.
ITCS
Ludmila Glinskih, Artur Riazanov
2024 J jnl
Partial Minimum Branching Program Size Problem is ETH-hard.
CoRR
Ludmila Glinskih, Artur Riazanov
2024 J jnl
Partial Minimum Branching Program Size Problem is ETH-hard.
Electron. Colloquium Comput. Complex.
Ludmila Glinskih, Artur Riazanov
2023 J jnl
The Complexity of Verifying Boolean Programs as Differentially Private.
CoRR
Mark Bun, Marco Gaboardi, Ludmila Glinskih
2022 B conf
MCSP is Hard for Read-Once Nondeterministic Branching Programs.
LATIN
Ludmila Glinskih, Artur Riazanov
2022 A conf
The Complexity of Verifying Boolean Programs as Differentially Private.
CSF
Mark Bun, Marco Gaboardi, Ludmila Glinskih
2021 J jnl
On Tseitin Formulas, Read-Once Branching Programs and Treewidth.
Theory Comput. Syst.
Ludmila Glinskih, Dmitry Itsykson
2019 Misc conf
On Tseitin Formulas, Read-Once Branching Programs and Treewidth.
CSR
Ludmila Glinskih, Dmitry Itsykson
2019 J jnl
On Tseitin formulas, read-once branching programs and treewidth.
Electron. Colloquium Comput. Complex.
Ludmila Glinskih, Dmitry Itsykson
2017 B conf
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
MFCS
Ludmila Glinskih, Dmitry Itsykson