Abstract is missing.
- Cybersecurity's Way Forward: to get Beautiful or InvisibleGianpaolo Bella. 1-7 [doi]
- Non-Atomic One-Round Walks in Polynomial Congestion GamesCosimo Vinci. 11-22 [doi]
- Conjunctive Query Answering via a Fragment of Set TheoryDomenico Cantone, Marianna Nicolosi Asmundo, Daniele Francesco Santamaria. 23-35 [doi]
- A Variant of Turing Machines with no Control States and its Connection to Bounded Temporal MemoryDomenico Cantone, Salvatore Cristofaro. 36-48 [doi]
- Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix SamplingLaura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala. 49-61 [doi]
- Types for Immutability and Aliasing ControlTiziana Calamoneri, Blerina Sinaimeri. 62-74 [doi]
- Runtime Checks as Nominal TypesPaola Giannini, Marco Servetto, Elena Zucca. 75-87 [doi]
- On the Bisimulation Hierarchy of State-to-Function Transition SystemsMarino Miculan, Marco Peressotti. 88-102 [doi]
- A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-TreesTiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti. 103-121 [doi]
- Gathering of Robots in a Ring with Mobile FaultsShantanu Das 0001, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Davide Moro, Marco Squarcina. 122-135 [doi]
- Improved Protocols for Luminous Asynchronous RobotsMattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra. 136-148 [doi]
- Active Spreading in NetworksGennaro Cordasco, Luisa Gargano, Adele A. Rescigno. 149-162 [doi]
- The Cost of Securing IoT CommunicationsChiara Bodei, Letterio Galletta. 163-176 [doi]
- A Semantics for Disciplined Concurrency in COPMatteo Busi, Pierpaolo Degano, Letterio Galletta. 177-189 [doi]
- On Exchange-Robust and Subst-Robust Primitive Partial WordsAnanda Chandra Nayak, Amit Kumar Srivastava, Kalpesh Kapoor. 190-202 [doi]
- Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic SystemsMarco Bernardo, Marino Miculan. 203-220 [doi]
- Reversible Semantics in Session-based ConcurrencyClaudio Antares Mezzina, Jorge Andrés Pérez. 221-226 [doi]
- Towards A Practical Model of Reactive Communication-Centric SoftwareJaime Arias, Mauricio Cano, Jorge Andrés Pérez. 227-233 [doi]
- Minimal and Reduced Reversible AutomataGiovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero. 234-239 [doi]
- Relating Paths in Transition Systems: the Fall of the Modal mu-CalculusCatalin Dima, Bastien Maubert, Sophie Pinchinat. 240-244 [doi]
- An Unifying Framework for Compacting Petri Nets BehaviorsGiovanni Casu, G. Michele Pinna. 245-250 [doi]
- Additional Winning Strategies in Two-Player GamesVadim Malvone, Aniello Murano. 251-256 [doi]
- Deadlock Analysis with Behavioral Types for ActorsVincenzo Mastandrea. 257-262 [doi]
- On the Clustered Shortest-Path Tree ProblemMattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti. 263-268 [doi]
- Influence Maximization in the Independent Cascade ModelGianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj. 269-274 [doi]
- A Mechanism Design Approach for Allocation of CommoditiesStefano Bistarelli, Rosario Culmone, Paolo Giuliodori, Stefano Mugnoz. 275-279 [doi]
- Merging Frequent SummariesMassimo Cafaro, Marco Pulimeno. 280-285 [doi]
- On Maximal Chain Subgraphs and Covers of Bipartite GraphsTiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri. 286-291 [doi]