Special Issue on Computer Science Symposium in Russia (2019)
ISSN:
1432-4350 (Print)
1433-0490 (Online)
In this topical collection (11 articles)
-
EditorialNotes
Special Issue on Computer Science Symposium in Russia (2019)
René van Bevern, Gregory Kucherov Pages 441-443 -
OriginalPaper
On Decidability of Theories of Regular Languages
Sergey Dudakov, Boris Karlov Pages 462-478 -
OriginalPaper
Transition Property for Cube-Free Words
Elena A. Petrova, Arseny M. Shur Pages 479-496 -
OriginalPaper
Parameterized Complexity of Conflict-Free Set Cover
Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman Pages 515-540 -
OriginalPaper
The Non-hardness of Approximating Circuit Size
Eric Allender, Rahul Ilango, Neekon Vafa Pages 559-578 -
OriginalPaper
Unpopularity Factor in the Marriage and Roommates Problems
Suthee Ruangwises, Toshiya Itoh Pages 579-592 -
OriginalPaper
Forward Looking Huffman Coding
Shmuel T. Klein, Shoham Saadia, Dana Shapira Pages 593-612 -
OriginalPaper
On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Ludmila Glinskih, Dmitry Itsykson Pages 613-633
Continue reading...
To view the rest of this content please follow the download PDF link above.