Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th ICTCS 2018: Urbino, Italy
- Alessandro Aldini, Marco Bernardo:
Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018. CEUR Workshop Proceedings 2243, CEUR-WS.org 2018
Invited Talks
- Davide Sangiorgi:
Bisimilarity Via Unique-Solution Techniques. 7-11
IC-EATCS Best Young Researcher
- Nicola Prezza:
On String Attractors. 12-16
IC-EATCS Best master thesis
- Francesco Dagnino:
Flexible Coinduction for Infinite Behaviour. 17-23
Session 1: Games and Distributed Algorithms
- Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Hedonic Games with Social Context. 24-35 - Félix Carvalho Rodrigues, Guido Schäfer, Eduardo C. Xavier:
On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games. 36-47 - Vittorio Bilò, Cosimo Vinci:
The Price of Anarchy of Affine Congestion Games with Similar Strategies. 48-59 - Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
On the Emergent Behavior of the 2-Choices Dynamics. 60-64
Session 2: Graphs
- Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Threshold-Bounded Dominating Set with Incentives. 65-76 - Serafino Cicerone, Mattia D'Emidio
, Daniele Frigioni:
On Mining Distances in Large-Scale Dynamic Graphs. 77-81 - Shima Moghtasedi:
Time-Based Similar Trajectories on Graphs. 82-86 - Ivano Salvo, Daniele Gorla, Pietro Cenciarelli:
Graph Theoretic Detection of Inefficiencies in Network Models. 87-91
Session 3: AI, Complexity and Decidability
- Ugo Dal Lago, Gabriele Vanoni:
On Randomised Strategies in the λ-calculus. 92-103 - Riccardo Focardi, Flaminia L. Luccio:
Neural Cryptanalysis of Classical Ciphers. 104-115 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete. 116-127 - Armando B. Matos, Luca Paolini, Luca Roversi:
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. 128-139
Session 4: Logics and Constraints
- Pietro Sala:
Metric Right Propositional Neighborhood Logic with an Equivalence Relation. 140-151 - Loredana Sorrentino, Sasha Rubin, Aniello Murano:
Graded CTL* over Finite Paths. 152-161 - Laura Giordano, Alberto Policriti:
Power (Set) ALC. 162-173
Session 5: Formal Languages and Static Analysis
- Stefano Bistarelli, Antonio Caruso:
Preliminary Results on the Modeling of System Level Diagnosis Problems with Abstract Argumentation. 179-190 - Paolo Massazza:
On the Generating Functions of Languages Accepted by Deterministic One-reversal Counter Machines. 191-202 - Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
A Taxonomy of Program Analyses. 213-217
Session 6: Concurrency
- Alessio Mansutti, Marino Miculan:
Deciding Hedged Bisimilarity. 218-229 - Silvia Crafa, Daniele Varacca:
On the Reactive Nature of Financial Networks. 230-241 - Tommaso Padoan:
Relating some Logics for True Concurrency. 242-253
a service of 
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 2024-04-19 19:18 CEST 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:
