Theory of Computing Systems

Self-Stabilizing Leader Election in Dynamic Networks

Ajoy K. Datta, Lawrence L. Larmore

Exact Localisations of Feedback Sets

Michael Hecht

A Closer Look at Fault Tolerance

Gadi Taubenfeld

Co-c.e. Sets with Disconnected Complements

Zvonko Iljazović, Bojan Pažek

Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs

Patrick Scharpfenecker

Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring

David Ilcinkas, Ahmed M. Wade

The Complexity of Tensor Rank

Marcus Schaefer, Daniel Štefankovič

Syntactic Complexity of Regular Ideals

Janusz A. Brzozowski, Marek Szykuła, Yuli Ye

From Tree Automata to String Automata Minimization

Younes Guellouma, Hadda Cherroun, Djelloul Ziadi, Bruce W. Watson

Collaborative Exploration of Trees by Energy-Constrained Mobile Robots

Shantanu Das, Dariusz Dereniowski, Christina Karousatou

The Algebraic Theory of Parikh Automata

Michaël Cadilhac, Andreas Krebs, Pierre McKenzie

On Effective Birkhoff’s Ergodic Theorem for Computable Actions of Amenable Groups

Nikita Moriakov

A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games

Vittorio Bilò

Homonym Population Protocols

Olivier Bournez, Johanne Cohen, Mikaël Rabie

Publisher Correction: Editor’s Note