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

• 2003
• 
  Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta:
  Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6): 409-421 (2003)
• 
  Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy:
  Consensus in Byzantine asynchronous systems. J. Discrete Algorithms 1(2): 185-210 (2003)
• 
  Vojtech Bálint:
  The non-approximability of bicriteria network design problems. J. Discrete Algorithms 1(3-4): 339-355 (2003)
• 
  Sergei Bespamyatnikh, Andrei V. Kelarev:
  Algorithms for shortest paths and d-cycle problems. J. Discrete Algorithms 1(1): 1-9 (2003)
• 
  Paolo Boldi, Sebastiano Vigna:
  Lower bounds for weak sense of direction. J. Discrete Algorithms 1(2): 119-128 (2003)
• 
  Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher:
  A derandomization using min-wise independent permutations. J. Discrete Algorithms 1(1): 11-20 (2003)
• 
  Serafino Cicerone, Gabriele Di Stefano:
  (k, +)-distance-hereditary graphs. J. Discrete Algorithms 1(3-4): 281-302 (2003)
• 
  Graeme L. Cohen, Ronald M. Sorli:
  On the number of distinct prime factors of an odd perfect number. J. Discrete Algorithms 1(1): 21-35 (2003)
• 
  Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
  A unifying look at the Apostolico-Giancarlo string-matching algorithm. J. Discrete Algorithms 1(1): 37-52 (2003)
• 
  Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek:
  Directed acyclic subsequence graph - Overview. J. Discrete Algorithms 1(3-4): 255-280 (2003)
• 
  David E. Daykin, Jacqueline W. Daykin:
  Lyndon-like and V-order factorizations of strings. J. Discrete Algorithms 1(3-4): 357-365 (2003)
• 
  Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
  Exact communication costs for consensus and leader in a tree. J. Discrete Algorithms 1(2): 167-183 (2003)
• 
  Michael J. Dinneen, Bakhadyr Khoussainov:
  Update games and update networks. J. Discrete Algorithms 1(1): 53-65 (2003)
• 
  William Duckworth, Nicholas C. Wormald, Michele Zito:
  A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. Discrete Algorithms 1(1): 67-76 (2003)
• 
  Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Alessandro Roncato, Nicola Santoro:
  On time versus size for monotone dynamic monopolies in regular topologies. J. Discrete Algorithms 1(2): 129-150 (2003)
• 
  Frantisek Franek, Weilin Lu, William F. Smyth:
  Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1(5-6): 445-460 (2003)
• 
  Cyril Gavoille, Akka Zemmari:
  The compactness of adaptive routing tables. J. Discrete Algorithms 1(2): 237-254 (2003)
• 
  Chryssis Georgiou, Alexander A. Shvartsman:
  Cooperative computing with fragmentable and mergeable groups. J. Discrete Algorithms 1(2): 211-235 (2003)
• 
  Ramesh Hariharan, V. Vinay:
  String matching in Õ(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1(1): 103-110 (2003)
• 
  Robert W. Irving, Lorna Love:
  The suffix binary search tree and suffix AVL tree. J. Discrete Algorithms 1(5-6): 387-408 (2003)
• 
  Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
  Optimal broadcast on parallel locality models. J. Discrete Algorithms 1(2): 151-166 (2003)
• 
  Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
  Approximate string matching on Ziv-Lempel compressed text. J. Discrete Algorithms 1(3-4): 313-338 (2003)
• 
  Jeffrey H. Kingston, Nicholas Paul Sheppard:
  On reductions for the Steiner Problem in Graphs. J. Discrete Algorithms 1(1): 77-88 (2003)
• 
  Francis C. M. Lau, Shi-Heng Zhang:
  Optimal gossiping in paths and cycles. J. Discrete Algorithms 1(5-6): 461-475 (2003)
• 
  Gonzalo Navarro:
  Regular expression searching on compressed text. J. Discrete Algorithms 1(5-6): 423-443 (2003)
• 
  Rolf Niedermeier, Peter Rossmanith:
  An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms 1(1): 89-102 (2003)
• 
  Jeong Seop Sim, Kunsoo Park:
  The consensus string problem for a metric is NP-complete. J. Discrete Algorithms 1(1): 111-117 (2003)
• 
  Carola Wenk:
  Applying an edit distance to the matching of tree ring sequences in dendrochronology. J. Discrete Algorithms 1(5-6): 367-385 (2003)
• 
  Fabrizio d'Amore, Fabio Iacobini:
  On-line algorithms for networks of temporal constraints. J. Discrete Algorithms 1(3-4): 303-312 (2003)