• 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 29 matches

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