• 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

• 1996
• 
  Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
  Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. SIROCCO 1996: 241-254
• 
  Joffroy Beauquier, Oliver Debas, Synnöve Kekkonen-Moneta:
  Fault-Tolerant and Self-Stabilizing Ring Orientation. SIROCCO 1996: 59-72
• 
  Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes:
  Tight Bounds on the Size of 2-Monopolies. SIROCCO 1996: 170-179
• 
  Paolo Boldi, Sebastiano Vigna:
  Good Fibrations and Other Construction Which Preserve Sense of Direction. SIROCCO 1996: 47-58
• 
  Paola Flocchini, Alessandro Roncato:
  Computing on Anonymous Networks with Sense of Direction. SIROCCO 1996: 32-46
• 
  Cyril Gavoille, Stephane Perennes:
  Lower Bounds for Shortest Path Interval Routing. SIROCCO 1996: 88-103
• 
  Rabah Harbane, Carles Padró:
  Spanners of Underlying Graphs of Iterated Line Digraphs. SIROCCO 1996: 180-194
• 
  Eckehart Hotzel:
  Full Access Networks of Small Size. SIROCCO 1996: 210-223
• 
  Esther Jennings, Lenka Motyckova:
  Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components. SIROCCO 1996: 224-240
• 
  Mariana Kant-Antonescu:
  Boolean Routing on Cube Networks. SIROCCO 1996: 125-140
• 
  Evangelos Kranakis:
  Invited Talk: Symmetry and Computability in Anonymous Networks. SIROCCO 1996: 1-16
• 
  Evangelos Kranakis, Danny Krizanc:
  Boolean Routing on Cayley Networks. SIROCCO 1996: 119-124
• 
  Bernard Mans:
  Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings. SIROCCO 1996: 17-31
• 
  Lata Narayanan, Naomi Nishimura:
  Interval Routing on k-trees. SIROCCO 1996: 104-118
• 
  Lata Narayanan, Sunil M. Shende:
  Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes. SIROCCO 1996: 73-87
• 
  Derek Hing-leung Ngok, Shmuel Zaks:
  On the Power of Local Information in Scheduling in Synchronous Networks. SIROCCO 1996: 301-312
• 
  Andrzej Pelc:
  Efficient fault location with small risk. SIROCCO 1996: 292-300
• 
  David Peleg:
  Majority Voting, Coalitions and Monopolies in Graphs. SIROCCO 1996: 152-169
• 
  Alessandro Roncato, Walter Unger:
  Systolic Gossip in Complete Trees. SIROCCO 1996: 279-291
• 
  Ladislav Stacho, Imrich Vrto:
  Virtual Path Layout for Some Bounded Degree Networks. SIROCCO 1996: 269-178
• 
  Gabriele Di Stefano:
  A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. SIROCCO 1996: 141-151
• 
  Ichiro Suzuki, Masafumi Yamashita:
  Distributed Anonymous Mobile Robots. SIROCCO 1996: 313-330
• 
  Pilar de la Torre, Clyde P. Kruskal:
  Exact Bandwith of Parallel-Processor Networks. SIROCCO 1996: 195-209
• 
  Pavel Tvrdík:
  Necklace-based Factorization of de Bruijn Digraphs. SIROCCO 1996: 255-168
• 
  Nicola Santoro, Paul G. Spirakis:
  SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996. Carleton Scientific 1996 [contents]