Hi, I'm Ludmila Glinskih
I am a PhD candidate in Theoretical Computer Science at Boston University
working with Prof. Mark Bun and Prof. Sofya Raskhodnikova.
During summer 2023 I was working as a Scientist Intern at Tumult Labs, where I was conducting research on differentially private algorithms. In spring semester 2023 I was visiting Simons Institute for the Theory of Computing for participating in the Meta-Complexity research program.
Before that I was a graduate researcher at the St. Petersburg Department of Steklov Institute of Mathematics RAS and got MSc in TCS from St. Petersburg Academic University RAS.
I am on the job market this year! I am looking for a postdoc position in academia or industry starting May-June 2024. Here is my CV and a short presentation about my research interests.
My email: lglinskih@gmail.com (or luda@bu.edu).
Ludmila Glinskih and Artur Riazanov.
MCSP is Hard for Read-Once Nondeterministic Branching Programs.
LATIN'22.
slides, poster
Mark Bun, Marco Gaboardi, and Ludmila Glinskih.
The Complexity of Verifying Boolean Programs as Differentially Private.
CSF'22.
arXiv, 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