Volume 65, Issue 3

Search all Theory of Computing Systems articles

April 2021

Special Issue on Computer Science Symposium in Russia (CSR 2019)

Issue Editors:

René Bevern,
Gregory Kucherov

11 articles in this issue

Special Issue on Computer Science Symposium in Russia (2019)
René van Bevern
Gregory Kucherov
EditorialNotes 10 February 2021 Pages: 441 - 443
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Derandomization for Sliding Window Algorithms with Strict Correctness^∗
Moses Ganardi
Danny Hucke
Markus Lohrey
OriginalPaper Open access 14 August 2020 Pages: 1 - 18
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
On Decidability of Theories of Regular Languages
Sergey Dudakov
Boris Karlov
OriginalPaper 13 August 2020 Pages: 462 - 478
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Transition Property for Cube-Free Words
Elena A. Petrova
Arseny M. Shur
OriginalPaper 21 April 2020 Pages: 479 - 496
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
Bireswar Das
Shivdutt Sharma
OriginalPaper 21 October 2020 Pages: 497 - 514
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Parameterized Complexity of Conflict-Free Set Cover
Ashwin Jacob
Diptapriyo Majumdar
Venkatesh Raman
OriginalPaper 12 January 2021 Pages: 515 - 540
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Belga B-Trees
Erik D. Demaine
John Iacono
Stefan Langerman
OriginalPaper 27 June 2020 Pages: 541 - 558
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
The Non-hardness of Approximating Circuit Size
Eric Allender
Rahul Ilango
Neekon Vafa
OriginalPaper 12 September 2020 Pages: 559 - 578
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Unpopularity Factor in the Marriage and Roommates Problems
Suthee Ruangwises
Toshiya Itoh
OriginalPaper 28 April 2020 Pages: 579 - 592
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
Forward Looking Huffman Coding
Shmuel T. Klein
Shoham Saadia
Dana Shapira
OriginalPaper 25 June 2020 Pages: 593 - 612
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)
On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Ludmila Glinskih
Dmitry Itsykson
OriginalPaper 09 October 2020 Pages: 613 - 633
Part of 2 collections:

Special Issue on Computer Science Symposium in Russia (2019)

Computer Science Symposium in Russia (CSR 2019)

Volume 65, Issue 3

Search

Navigation