We stand with Ukraine  

Ludmila Glinskih

Affiliations:
  • Boston University, USA
  • Steklov Institute of Mathematics, St. Petersburg Department, Russia (former)


According to our database1, Ludmila Glinskih authored at least 5 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Partial Minimum Branching Program Size Problem Is ETH-Hard.
[BibTeX]
[DOI]
Ludmila Glinskih
,
Artur Riazanov
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2022
MCSP is Hard for Read-Once Nondeterministic Branching Programs.
[BibTeX]
[DOI]
Ludmila Glinskih
,
Artur Riazanov
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

The Complexity of Verifying Boolean Programs as Differentially Private.
[BibTeX]
[DOI]
Mark Bun
,
Marco Gaboardi
,
Ludmila Glinskih
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2019
On Tseitin Formulas, Read-Once Branching Programs and Treewidth.
[BibTeX]
[DOI]
Ludmila Glinskih
,
Dmitry Itsykson
Proceedings of the Computer Science - Theory and Applications, 2019

2017
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
[BibTeX]
[DOI]
Ludmila Glinskih
,
Dmitry Itsykson
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017


  Loading...