• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 25 matches

• 2018
• 
  Laura Giordano, Alberto Policriti:
  Power (Set) ALC. ICTCS 2018: 162-173
• 
  Gianluca Amato, Maria Chiara Meo, Francesca Scozzari:
  A Taxonomy of Program Analyses. ICTCS 2018: 213-217
• 
  Vittorio Bilò, Cosimo Vinci:
  The Price of Anarchy of Affine Congestion Games with Similar Strategies. ICTCS 2018: 48-59
• 
  Stefano Bistarelli, Antonio Caruso:
  Preliminary Results on the Modeling of System Level Diagnosis Problems with Abstract Argumentation. ICTCS 2018: 179-190
• 
  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. ICTCS 2018: 116-127
• 
  Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni:
  On Mining Distances in Large-Scale Dynamic Graphs. ICTCS 2018: 77-81
• 
  Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
  Threshold-Bounded Dominating Set with Incentives. ICTCS 2018: 65-76
• 
  Silvia Crafa, Daniele Varacca:
  On the Reactive Nature of Financial Networks. ICTCS 2018: 230-241
• 
  Emilio Cruciani, Emanuele Natale, André Nusser, Giacomo Scornavacca:
  On the Emergent Behavior of the 2-Choices Dynamics. ICTCS 2018: 60-64
• 
  Francesco Dagnino:
  Flexible Coinduction for Infinite Behaviour. ICTCS 2018: 17-23
• 
  Riccardo Focardi, Flaminia L. Luccio:
  Neural Cryptanalysis of Classical Ciphers. ICTCS 2018: 104-115
• 
  Ugo Dal Lago, Gabriele Vanoni:
  On Randomised Strategies in the λ-calculus. ICTCS 2018: 92-103
• 
  Alessio Mansutti, Marino Miculan:
  Deciding Hedged Bisimilarity. ICTCS 2018: 218-229
• 
  Paolo Massazza:
  On the Generating Functions of Languages Accepted by Deterministic One-reversal Counter Machines. ICTCS 2018: 191-202
• 
  Armando B. Matos, Luca Paolini, Luca Roversi:
  The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS 2018: 128-139
• 
  Shima Moghtasedi:
  Time-Based Similar Trajectories on Graphs. ICTCS 2018: 82-86
• 
  Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
  Hedonic Games with Social Context. ICTCS 2018: 24-35
• 
  Tommaso Padoan:
  Relating some Logics for True Concurrency. ICTCS 2018: 242-253
• 
  Nicola Prezza:
  On String Attractors. ICTCS 2018: 12-16
• 
  Félix Carvalho Rodrigues, Guido Schäfer, Eduardo C. Xavier:
  On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games. ICTCS 2018: 36-47
• 
  Pietro Sala:
  Metric Right Propositional Neighborhood Logic with an Equivalence Relation. ICTCS 2018: 140-151
• 
  Ivano Salvo, Daniele Gorla, Pietro Cenciarelli:
  Graph Theoretic Detection of Inefficiencies in Network Models. ICTCS 2018: 87-91
• 
  Davide Sangiorgi:
  Bisimilarity Via Unique-Solution Techniques. ICTCS 2018: 7-11
• 
  Loredana Sorrentino, Sasha Rubin, Aniello Murano:
  Graded CTL* over Finite Paths. ICTCS 2018: 152-161
• 
  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 [contents]