Volume 65, Issue 4

Search all Theory of Computing Systems articles

May 2021

Special Issue on Theoretical Aspects of Computer Science (STACS 2019)

Issue Editors:

Rolf Niedermeier,
Christophe Paul

6 articles in this issue

Preface of STACS 2019 Special Issue
Rolf Niedermeier
Christophe Paul
EditorialNotes Open access 09 March 2021 Pages: 635 - 637
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2019)

Theoretical Aspects of Computer Science (STACS 2019)
First-Order Orbit Queries
Shaull Almagor
Joël Ouaknine
James Worrell
OriginalPaper 04 April 2020 Pages: 638 - 661
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2019)

Theoretical Aspects of Computer Science (STACS 2019)
Token Sliding on Split Graphs
Rémy Belmonte
Eun Jung Kim
Florian Sikora
OriginalPaper 10 March 2020 Pages: 662 - 686
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2019)

Theoretical Aspects of Computer Science (STACS 2019)
Space Lower Bounds for the Signal Detection Problem
Faith Ellen
Rati Gelashvili
Leqi Zhu
OriginalPaper Open access 20 July 2020 Pages: 687 - 705
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2019)

Theoretical Aspects of Computer Science (STACS 2019)
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
Antoine Mottet
Karin Quaas
OriginalPaper 15 September 2020 Pages: 706 - 735
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2019)

Theoretical Aspects of Computer Science (STACS 2019)
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
Erik Paul
OriginalPaper Open access 26 March 2021 Pages: 736 - 776
Part of 2 collections:

Special Issue on Theoretical Aspects of Computer Science (2019)

Theoretical Aspects of Computer Science (STACS 2019)

Volume 65, Issue 4

Preface of STACS 2019 Special Issue

First-Order Orbit Queries

Token Sliding on Split Graphs

Space Lower Bounds for the Signal Detection Problem

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata

Finite Sequentiality of Unambiguous Max-Plus Tree Automata

Search

Navigation