Abstract is missing.
- Symmetric Groups and Quotient Complexity of Boolean OperationsJason Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis. 1-12 [doi]
- Handling Infinitely Branching WSTSMichael Blondin, Alain Finkel, Pierre McKenzie. 13-25 [doi]
- Transducers with Origin InformationMikolaj Bojanczyk. 26-37 [doi]
- Weak MSO+U with Path Quantifiers over Infinite TreesMikolaj Bojanczyk. 38-49 [doi]
- On the Decidability of MSO+U on Infinite TreesMikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak. 50-61 [doi]
- A Coalgebraic Foundation for Coinductive Union TypesMarcello M. Bonsangue, Jurriaan Rot, Davide Ancona, Frank S. de Boer, Jan J. M. M. Rutten. 62-73 [doi]
- Turing Degrees of Limit Sets of Cellular AutomataAlex Borello, Julien Cervelle, Pascal Vanier. 74-85 [doi]
- On the Complexity of Temporal-Logic Path CheckingDaniel Bundala, Joël Ouaknine. 86-97 [doi]
- Parameterised LinearisabilityAndrea Cerone, Alexey Gotsman, Hongseok Yang. 98-109 [doi]
- Games with a Weak AdversaryKrishnendu Chatterjee, Laurent Doyen 0001. 110-121 [doi]
- The Complexity of Ergodic Mean-payoff GamesKrishnendu Chatterjee, Rasmus Ibsen-Jensen. 122-133 [doi]
- Toward a Structure Theory of Regular Infinitary Trace LanguagesNamit Chaturvedi. 134-145 [doi]
- Unary Pushdown Automata and Straight-Line ProgramsDmitry V. Chistikov, Rupak Majumdar. 146-157 [doi]
- Robustness against Power is PSpace-completeEgor Derevenetc, Roland Meyer. 158-170 [doi]
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance LogicManfred Droste, Vitaly Perevoshchikov. 171-182 [doi]
- Computability in Anonymous Networks: Revocable vs. Irrecovable OutputsYuval Emek, Jochen Seidel, Roger Wattenhofer. 183-195 [doi]
- Coalgebraic Weak Bisimulation from Recursive Equations over MonadsSergey Goncharov, Dirk Pattinson. 196-207 [doi]
- Piecewise Boolean Algebras and Their DomainsChris Heunen. 208-219 [doi]
- Between Linearizability and Quiescent Consistency - Quantitative Quiescent ConsistencyRadha Jagadeesan, James Riely. 220-231 [doi]
- Bisimulation Equivalence of First-Order GrammarsPetr Jancar. 232-243 [doi]
- Context Unification is in PSPACEArtur Jez. 244-255 [doi]
- Monodic Fragments of Probabilistic First-Order LogicJean Christoph Jung, Carsten Lutz, Sergey Goncharov, Lutz Schröder. 256-267 [doi]
- Stability and Complexity of Minimising Probabilistic AutomataStefan Kiefer, Björn Wachter. 268-279 [doi]
- Kleene Algebra with EquationsDexter Kozen, Konstantinos Mamouras. 280-292 [doi]
- All-Instances Termination of Chase is UndecidableTomasz Gogacz, Jerzy Marcinkowski. 293-304 [doi]
- Non-uniform Polytime Computation in the Infinitary Affine Lambda-CalculusDamiano Mazza. 305-317 [doi]
- On the Positivity Problem for Simple Linear Recurrence Sequences, Joël Ouaknine, James Worrell. 318-329 [doi]
- Ultimate Positivity is Decidable for Simple Linear Recurrence SequencesJoël Ouaknine, James Worrell. 330-341 [doi]
- Going Higher in the First-Order Quantifier Alternation Hierarchy on WordsThomas Place, Marc Zeitoun. 342-353 [doi]
- Hardness Results for Intersection Non-EmptinessMichael Wehar. 354-362 [doi]
- Branching Bisimilarity Checking for PRSQiang Yin, Yuxi Fu, Chaodong He, Mingzhang Huang, Xiuting Tao. 363-374 [doi]
- Labeling Schemes for Bounded Degree GraphsDavid Adjiashvili, Noy Rotbart. 375-386 [doi]
- Bounded-Angle Spanning Tree: Modeling Networks with Angular ConstraintsRom Aschner, Matthew J. Katz. 387-398 [doi]
- Distributed Computing on Core-Periphery Networks: Axiom-Based DesignChen Avin, Michael Borokhovich, Zvi Lotker, David Peleg. 399-410 [doi]
- Fault-Tolerant Rendezvous in NetworksJérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. 411-422 [doi]
- Data Delivery by Energy-Constrained Mobile Agents on a LineJérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer. 423-434 [doi]
- The Power of Two Choices in Distributed VotingColin Cooper, Robert Elsässer, Tomasz Radzik. 435-446 [doi]
- Jamming-Resistant Learning in Wireless NetworksJohannes Dams, Martin Hoefer, Thomas Kesselheim. 447-458 [doi]
- Facility Location in Evolving MetricsDavid Eisenstat, Claire Mathieu, Nicolas Schabanel. 459-470 [doi]
- Solving the ANTS Problem with Asynchronous Finite State MachinesYuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer. 471-482 [doi]
- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating SetMohsen Ghaffari. 483-494 [doi]
- Randomized Rumor Spreading in Dynamic GraphsGeorge Giakkoupis, Thomas Sauerwald, Alexandre Stauffer. 495-507 [doi]
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and PeriodsOliver Göbel 0002, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking. 508-519 [doi]
- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related ProblemsErez Kantor, Shay Kutten. 520-531 [doi]
- Orienting Fully Dynamic Graphs with Worst-Case Time BoundsTsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon. 532-543 [doi]
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-RouterAdrian Kosowski, Dominik Pajak. 544-555 [doi]
- The Melbourne Shuffle: Improving Oblivious Storage in the CloudOlga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal. 556-567 [doi]
- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast ProblemsAfshin Nikzad, R. Ravi. 568-607 [doi]
- Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise SpannersMerav Parter. 608-619 [doi]