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

• 2005
• 
  Alejandro López-Ortiz, Angèle M. Hamel:
  Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3405, Springer 2005, ISBN 3-540-27873-7 [contents]
• 2004
• 
  Claus Bauer:
  Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches. CAAN 2004: 102-113
• 
  Anthony Bonato:
  A Survey of Models of the Web Graph. CAAN 2004: 159-172
• 
  Anthony Bonato, Jeannette C. M. Janssen:
  Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces. CAAN 2004: 42-48
• 
  Andrei Z. Broder:
  Invited Talk: The Many Wonders of the Web Graph. CAAN 2004: 154-154
• 
  Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram:
  String Matching on the Internet. CAAN 2004: 75-89
• 
  Sung-woo Cho, Ashish Goel:
  Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives. CAAN 2004: 28-41
• 
  Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani:
  Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis. CAAN 2004: 140-153
• 
  Mihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani:
  Aggregating Correlated Data in Sensor Networks. CAAN 2004: 1-2
• 
  Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
  Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN 2004: 49-62
• 
  Jean-Charles Grégoire, Angèle M. Hamel:
  You Can Get There from Here: Routing in the Internet. CAAN 2004: 173-182
• 
  Jean-Loup Guillaume, Matthieu Latapy:
  Bipartite Graphs as Models of Complex Networks. CAAN 2004: 127-139
• 
  Jan van den Heuvel, Matthew Johnson:
  The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN 2004: 114-126
• 
  George Karakostas, Stavros G. Kolliopoulos:
  The Efficiency of Optimal Taxes. CAAN 2004: 3-12
• 
  Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
  Congestion Games, Load Balancing, and Price of Anarchy. CAAN 2004: 13-27
• 
  André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
  k-Robust Single-Message Transmission. CAAN 2004: 90-101
• 
  Eythan Levy, Guy Louchard, Jordi Petit:
  A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs. CAAN 2004: 63-74
• 
  Alejandro López-Ortiz:
  Algorithmic Foundations of the Internet: Foreword. CAAN 2004: 155-158
• 
  Alejandro López-Ortiz:
  Search Engines and Web Information Retrieval. CAAN 2004: 183-191
• 
  Alejandro López-Ortiz:
  Algorithmic Foundations of the Internet: Roundup. CAAN 2004: 192-204