Ludmila Glinskih
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
3
Venues
3
Active years
2017–2022
Best venue rank
B
Where they publish
Papers
3 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | LATIN | MCSP is Hard for Read-Once Nondeterministic Branching Programs. | Ludmila Glinskih, Artur Riazanov |
| 2019 | CSR | On Tseitin Formulas, Read-Once Branching Programs and Treewidth. | Ludmila Glinskih, Dmitry Itsykson |
| 2017 | MFCS | Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. | Ludmila Glinskih, Dmitry Itsykson |