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

• 2005
• 
  Micah Adler, Adi Rosén:
  Tight bounds for the performance of Longest In System on DAGs. J. Algorithms 55(2): 101-112 (2005)
• 
  William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
  Competitive queue policies for differentiated services. J. Algorithms 55(2): 113-141 (2005)
• 
  Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
  On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms 55(1): 76-92 (2005)
• 
  Yair Bartal, Manor Mendel:
  Randomized k-server algorithms for growth-rate bounded graphs. J. Algorithms 55(2): 192-202 (2005)
• 
  Graham Cormode, S. Muthukrishnan:
  An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1): 58-75 (2005)
• 
  Michael Filaseta, Douglas B. Meade:
  Irreducibility testing of lacunary 0, 1-polynomials. J. Algorithms 55(1): 21-28 (2005)
• 
  Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:
  An online throughput-competitive algorithm for multicast routing and admission control. J. Algorithms 55(1): 1-20 (2005)
• 
  Yoo Ah Kim:
  Data migration to minimize the total completion time. J. Algorithms 55(1): 42-57 (2005)
• 
  Benoît Larose, Cynthia Loten, László Zádori:
  A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55(2): 177-191 (2005)
• 
  Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna:
  The Guessing Secrets problem: a probabilistic approach. J. Algorithms 55(2): 142-176 (2005)
• 
  Moni Naor:
  On fairness in the carpool problem. J. Algorithms 55(1): 93-98 (2005)
• 
  Petra Sparl, Janez Zerovnik:
  2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1): 29-41 (2005)