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 2024.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Partial Minimum Branching Program Size Problem is ETH-hard.
Electron. Colloquium Comput. Complex., 2024

2022
MCSP is Hard for Read-Once Nondeterministic Branching Programs.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

The Complexity of Verifying Boolean Programs as Differentially Private.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2019
On Tseitin formulas, read-once branching programs and treewidth.
Electron. Colloquium Comput. Complex., 2019

2017
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017


  Loading...