Ludmila Glinskih

Affiliations:

Steklov Institute of Mathematics, St. Petersburg Department, Russia

According to our database¹, Ludmila Glinskih authored at least 4 papers between 2017 and 2022.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2022

MCSP is Hard for Read-Once Nondeterministic Branching Programs.

[BibT_eX]

[DOI]

Ludmila Glinskih

Artur Riazanov

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

The Complexity of Verifying Boolean Programs as Differentially Private.

[BibT_eX]

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

[BibT_eX]

[DOI]

Ludmila Glinskih

Dmitry Itsykson

Electron. Colloquium Comput. Complex., 2019

2017

Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.

[BibT_eX]

[DOI]

Ludmila Glinskih

Dmitry Itsykson

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Ludmila Glinskih

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...