Journal: Theory Comput. Syst.

Volume 62, Issue 5

977 -- 1047Ajoy K. Datta, Lawrence L. Larmore. Self-Stabilizing Leader Election in Dynamic Networks
1048 -- 1084Michael Hecht. Exact Localisations of Feedback Sets
1085 -- 1108Gadi Taubenfeld. A Closer Look at Fault Tolerance
1109 -- 1124Zvonko Iljazovic, Bojan Pazek. Co-c.e. Sets with Disconnected Complements
1125 -- 1143Patrick Scharpfenecker. Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs
1144 -- 1160David Ilcinkas, Ahmed Mouhamadou Wade. Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
1161 -- 1174Marcus Schaefer, Daniel Stefankovic. The Complexity of Tensor Rank
1175 -- 1202Janusz A. Brzozowski, Marek Szykula, Yuli Ye. Syntactic Complexity of Regular Ideals
1203 -- 1222Younes Guellouma, Hadda Cherroun, Djelloul Ziadi, Bruce W. Watson. From Tree Automata to String Automata Minimization
1223 -- 1240Shantanu Das 0001, Dariusz Dereniowski, Christina Karousatou. Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
1241 -- 1268Michaël Cadilhac, Andreas Krebs, Pierre McKenzie. The Algebraic Theory of Parikh Automata
1269 -- 1287Nikita Moriakov. On Effective Birkhoff's Ergodic Theorem for Computable Actions of Amenable Groups
1288 -- 1317Vittorio Bilò. A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games
1318 -- 1346Olivier Bournez, Johanne Cohen, Mikaël Rabie. Homonym Population Protocols