Volume 64, Issue 3

Search all Theory of Computing Systems articles

April 2020

Special Issue on Theoretical Aspects of Computer Science (2018)

Issue Editors:

Rolf Niedermeier,
Brigitte Vallée

9 articles in this issue

Preface of the Special Issue on Theoretical Aspects of Computer Science (2018)
Rolf Niedermeier
Brigitte Vallée
EditorialNotes 30 January 2020 Pages: 371 - 373
Part of 3 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
Computing Hitting Set Kernels By AC⁰-Circuits
Max Bannach
Till Tantau
OriginalPaper 28 November 2019 Pages: 374 - 399
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
Lower Bound Techniques for QBF Expansion
Olaf Beyersdorff
Joshua Blinkhorn
OriginalPaper 05 August 2019 Pages: 400 - 421
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
On the Tree Conjecture for the Network Creation Game
Davide Bilò
Pascal Lenzner
OriginalPaper 16 August 2019 Pages: 422 - 443
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
Marco Bressan
Enoch Peserico
Luca Pretto
OriginalPaper 05 April 2019 Pages: 444 - 466
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
Dependences in Strategy Logic
Patrick Gardy
Patricia Bouyer
Nicolas Markey
OriginalPaper 08 January 2020 Pages: 467 - 507
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
Optimal Dislocation with Persistent Errors in Subquadratic Time
Barbara Geissmann
Stefano Leucci
Paolo Penna
OriginalPaper 03 December 2019 Pages: 508 - 521
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
Space-Efficient Algorithms for Longest Increasing Subsequence
Masashi Kiyomi
Hirotaka Ono
Jun Tarui
OriginalPaper 22 January 2019 Pages: 522 - 541
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)
Additive Number Theory via Automata Theory
Aayush Rajasekaran
Jeffrey Shallit
Tim Smith
OriginalPaper 29 May 2019 Pages: 542 - 567
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2018)

Theoretical Aspects of Computer Science (STACS 2018)

Volume 64, Issue 3

Search

Navigation