default search action
Theoretical Computer Science, Volume 764
Volume 764, April 2019
- Vittorio Bilò, Antonio Caruso:
Editorial. 1 - Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. 2-14 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Active influence spreading in social networks. 15-29 - Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Recommending links through influence maximization. 30-41 - Shantanu Das, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Marco Squarcina:
Gathering of robots in a ring with mobile faults. 42-60 - Cosimo Vinci:
Non-atomic one-round walks in congestion games. 61-79 - Marco Bernardo, Marino Miculan:
Constructive logical characterizations of bisimilarity for reactive probabilistic systems. 80-99 - Chiara Bodei, Stefano Chessa, Letterio Galletta:
Measuring security in IoT communications. 100-124 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Which fragments of the interval temporal logic HS are tractable in model checking? 125-144 - Paola Giannini, Marco Servetto, Elena Zucca, James Cone:
Flexible recovery of uniqueness and immutability. 145-172
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.