Hi, I'm Ludmila Glinskih
I am a PhD student in Theoretical Computer Science at Boston University
working with Prof. Mark Bun and Prof. Sofya Raskhodnikova.
Before that I was a PhD student at the St. Petersburg Department of Steklov Institute of Mathematics RAS and got MSc in TCS from St. Petersburg Academic University RAS.
My email: lglinskih@gmail.com (or luda@bu.edu).
Ludmila Glinskih and Artur Riazanov.
MCSP is Hard for Read-Once Nondeterministic Branching Programs.
In submission.
Mark Bun, Marco Gaboardi, and Ludmila Glinskih.
The Complexity of Verifying Boolean Programs as Differentially Private.
To appear in the proceedings of CSF'22.
slides
Ludmila Glinskih and Dmitry Itsykson.
On Tseitin Formulas, Read-Once Branching Programs and Treewidth.
CSR'19, Best Paper Award.
Theory of Computing Systems 65(3): 613-633, 2021.
ECCC, slides, poster
Ludmila Glinskih and Dmitry Itsykson.
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
MFCS'17.
LIPIcs, slides