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

• 2017
• 
  François Bonnet, Quentin Bramas, Xavier Défago, Thanh Dang Nguyen:
  Killing Nodes as a Countermeasure to Virus Expansion. SIROCCO 2017: 227-243
• 
  Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier:
  Monitoring of Domain-Related Problems in Distributed Data Streams. SIROCCO 2017: 212-226
• 
  Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
  Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO 2017: 303-317
• 
  Peva Blanchard, Rachid Guerraoui:
  On the Smallest Grain of Salt to Get a Unique Identity. SIROCCO 2017: 106-121
• 
  Sebastian Brandt, Klaus-Tycho Foerster, Benjamin Richner, Roger Wattenhofer:
  Wireless Evacuation on m Rays with k Searchers. SIROCCO 2017: 140-157
• 
  Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
  A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. SIROCCO 2017: 321-338
• 
  Keren Censor-Hillel, Ami Paz, Mor Perry:
  Approximate Proof-Labeling Schemes. SIROCCO 2017: 71-89
• 
  Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk:
  Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO 2017: 158-173
• 
  Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
  A General Lower Bound for Collaborative Tree Exploration. SIROCCO 2017: 125-139
• 
  Laurent Feuilloley:
  How Long It Takes for an Ordinary Node with an Ordinary ID to Output? SIROCCO 2017: 263-282
• 
  Barun Gorain, Andrzej Pelc:
  Short Labeling Schemes for Topology Recognition in Wireless Tree Networks. SIROCCO 2017: 37-52
• 
  Karol Gotfryd, Marek Klonowski, Dominik Pajak:
  On Location Hiding in Distributed Systems. SIROCCO 2017: 174-192
• 
  Magnús M. Halldórsson, Stephan Holzer, Evangelia Anna Markatou:
  Leader Election in SINR Model with Arbitrary Power Control. SIROCCO 2017: 3-14
• 
  Magnús M. Halldórsson, Christian Konrad:
  Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees. SIROCCO 2017: 247-262
• 
  Tomasz Jurdzinski, Michal Rózanski, Grzegorz Stachowiak:
  Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing. SIROCCO 2017: 15-33
• 
  Amos Korman, Yoav Rodeh:
  Parallel Search with No Coordination. SIROCCO 2017: 195-211
• 
  Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta:
  Gathering in Dynamic Rings. SIROCCO 2017: 339-355
• 
  Lata Narayanan, Kangkang Wu:
  How to Choose Friends Strategically. SIROCCO 2017: 283-302
• 
  Rafail Ostrovsky, Mor Perry, Will Rosenbaum:
  Space-Time Tradeoffs for Distributed Verification. SIROCCO 2017: 53-70
• 
  Mikaël Rabie:
  Global Versus Local Computations: Fast Computing with Identifiers. SIROCCO 2017: 90-105
• 
  Alexander Spiegelman, Idit Keidar:
  On Liveness of Dynamic Storage. SIROCCO 2017: 356-376
• 
  Shantanu Das, Sébastien Tixeuil:
  Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10641, Springer 2017, ISBN 978-3-319-72049-4 [contents]