• 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

• 2000
• 
  Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy:
  Consensus in byzantine asynchronous systems. SIROCCO 2000: 1-15
• 
  René Beier, Jop F. Sibeyn:
  A powerful heuristic for telephone gossiping. SIROCCO 2000: 17-35
• 
  Paolo Boldi, Sebastiano Vigna:
  Lower bounds for (weak) sense of direction. SIROCCO 2000: 37-46
• 
  Marc Bui, Sajal K. Das, Ajoy Kumar Datta, Dai Tho Nguyen:
  Randomized mobile agent based routing in wireless networks. SIROCCO 2000: 47-61
• 
  Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
  Exact communication costs for consensus and leader in a tree. SIROCCO 2000: 63-77
• 
  Stefan Dobrev:
  Efficient wakeup in anonymous oriented complete graphs. SIROCCO 2000: 79-93
• 
  Bertrand Ducourthial, Sébastien Tixeuil:
  Self-stabilization with path algebra. SIROCCO 2000: 95-109
• 
  Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro:
  On time versus size for monotone dynamic monopolies in regular topologies. SIROCCO 2000: 111-125
• 
  Cyril Gavoille, Akka Zemmari:
  The compactness of adaptive routing tables. SIROCCO 2000: 127-139
• 
  Chryssis Georgiou, Alexander A. Shvartsman:
  Cooperative computing with fragmentable and mergeable groups. SIROCCO 2000: 141-156
• 
  Hovhannes A. Harutyunyan:
  Multiple message broadcasting in modified Knödel graph. SIROCCO 2000: 157-165
• 
  Yehuda Hassin, David Peleg:
  Extremal bounds for probabilistic polling in graphs. SIROCCO 2000: 167-180
• 
  Jean-Michel Hélary, Giovanna Melideo, Michel Raynal:
  Tracking causality in distributed systems: a suite of efficient protocols. SIROCCO 2000: 181-195
• 
  Frank K. Hwang, S. K. Chen:
  The 1.5-loop network and the mixed 1.5-loop network. SIROCCO 2000: 297-306
• 
  Alexis Irlande, Jean-Claude König, Christian Laforest:
  Construction of low-cost and low-diameter Steiner trees for multipoint groups. SIROCCO 2000: 197-210
• 
  Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
  Optimal broadcast on parallel locality models. SIROCCO 2000: 221-225
• 
  Fabrizio Luccio, Linda Pagli:
  An algorithmic definition of interval with applications to routing. SIROCCO 2000: 227-236
• 
  Yves Métivier, Gerard Tel:
  Termination detection and universal graph reconstruction. SIROCCO 2000: 237-251
• 
  Koji Nakano, Stephan Olariu:
  A randomized leader election protocol for ad-hoc networks. SIROCCO 2000: 253-267
• 
  André Raspaud, Ondrej Sýkora, Imrich Vrto:
  Congestion and dilation, similarities and differences: A survey. SIROCCO 2000: 269-280
• 
  Alan Roberts, Antonios Symvonis, David R. Wood:
  Lower bounds for hot-potato permutation routing on trees. SIROCCO 2000: 281-295
• 
  Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis:
  SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000. Carleton Scientific 2000 [contents]