default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th ICTCS 2016: Lecce, Italy
- Vittorio Bilò, Antonio Caruso:
Proceedings of the 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016. CEUR Workshop Proceedings 1720, CEUR-WS.org 2016
Invited Papers
- Gianpaolo Bella:
Cybersecurity's Way Forward: to get Beautiful or Invisible. 1-7
Regular Papers
- Cosimo Vinci:
Non-Atomic One-Round Walks in Polynomial Congestion Games. 11-22 - Domenico Cantone, Marianna Nicolosi Asmundo, Daniele Francesco Santamaria:
Conjunctive Query Answering via a Fragment of Set Theory. 23-35 - Domenico Cantone, Salvatore Cristofaro:
A Variant of Turing Machines with no Control States and its Connection to Bounded Temporal Memory. 36-48 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling. 49-61 - Paola Giannini, Marco Servetto, Elena Zucca:
Types for Immutability and Aliasing Control. 62-74 - Paola Giannini, Marco Servetto, Elena Zucca:
Runtime Checks as Nominal Types. 75-87 - Marino Miculan, Marco Peressotti:
On the Bisimulation Hierarchy of State-to-Function Transition Systems. 88-102 - Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. 103-121 - Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Davide Moro, Marco Squarcina:
Gathering of Robots in a Ring with Mobile Faults. 122-135 - Mattia D'Emidio
, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Improved Protocols for Luminous Asynchronous Robots. 136-148 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Active Spreading in Networks. 149-162 - Chiara Bodei, Letterio Galletta:
The Cost of Securing IoT Communications. 163-176 - Matteo Busi, Pierpaolo Degano, Letterio Galletta:
A Semantics for Disciplined Concurrency in COP. 177-189 - Ananda Chandra Nayak, Amit Kumar Srivastava, Kalpesh Kapoor:
On Exchange-Robust and Subst-Robust Primitive Partial Words. 190-202 - Marco Bernardo, Marino Miculan:
Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems. 203-220
Communications
- Claudio Antares Mezzina, Jorge Andrés Pérez:
Reversible Semantics in Session-based Concurrency. 221-226 - Jaime Arias, Mauricio Cano, Jorge Andrés Pérez:
Towards A Practical Model of Reactive Communication-Centric Software. 227-233 - Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Minimal and Reduced Reversible Automata. 234-239 - Catalin Dima, Bastien Maubert, Sophie Pinchinat:
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. 240-244 - Giovanni Casu, G. Michele Pinna:
An Unifying Framework for Compacting Petri Nets Behaviors. 245-250 - Vadim Malvone, Aniello Murano:
Additional Winning Strategies in Two-Player Games. 251-256 - Vincenzo Mastandrea:
Deadlock Analysis with Behavioral Types for Actors. 257-262 - Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
On the Clustered Shortest-Path Tree Problem. 263-268 - Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Influence Maximization in the Independent Cascade Model. 269-274 - Stefano Bistarelli, Rosario Culmone, Paolo Giuliodori, Stefano Mugnoz:
A Mechanism Design Approach for Allocation of Commodities. 275-279 - Massimo Cafaro, Marco Pulimeno:
Merging Frequent Summaries. 280-285 - Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. 286-291
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-06 22:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
