• 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

• 2004
• 
  Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari:
  Longest increasing subsequences in sliding windows. Theor. Comput. Sci. 321(2-3): 405-414 (2004)
• 
  Michael A. Bender, Martin Farach-Colton:
  The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (2004)
• 
  Claudson F. Bornstein, Santosh S. Vempala:
  Flow metrics. Theor. Comput. Sci. 321(1): 13-24 (2004)
• 
  Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
  Updatable timed automata. Theor. Comput. Sci. 321(2-3): 291-345 (2004)
• 
  Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint:
  Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004)
• 
  Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, Eduardo Sany Laber:
  Searching in random partially ordered sets. Theor. Comput. Sci. 321(1): 41-57 (2004)
• 
  Matteo Cavaliere, Peter Leupold:
  Evolution and observation--a non-standard way to generate formal languages. Theor. Comput. Sci. 321(2-3): 233-248 (2004)
• 
  Dong Pyo Chi, DoYong Kwon:
  Sturmian words, beta-shifts, and transcendence. Theor. Comput. Sci. 321(2-3): 395-404 (2004)
• 
  Rodney G. Downey, Evan J. Griffiths, Stephanie Reid:
  On Kurtz randomness. Theor. Comput. Sci. 321(2-3): 249-270 (2004)
• 
  Juan Luis Esteban, Nicola Galesi, Jochen Messner:
  On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004)
• 
  Juan A. Garay, Sergio Rajsbaum:
  Preface. Theor. Comput. Sci. 321(1): 1-3 (2004)
• 
  Theodoulos Garefalakis:
  The generalized Weil pairing and the discrete logarithm problem on elliptic curves. Theor. Comput. Sci. 321(1): 59-72 (2004)
• 
  Alejandro Hevia, Marcos A. Kiwi:
  Electronic jury voting protocols. Theor. Comput. Sci. 321(1): 73-94 (2004)
• 
  Jason J. Holdsworth:
  Graph traversal and graph transformation. Theor. Comput. Sci. 321(2-3): 215-231 (2004)
• 
  Martin Klazar:
  On the least exponential growth admitting uncountably many closed permutation classes. Theor. Comput. Sci. 321(2-3): 271-281 (2004)
• 
  Keqin Li:
  Analysis of randomized load distribution for reproduction trees in linear arrays and rings. Theor. Comput. Sci. 321(2-3): 195-214 (2004)
• 
  S. Muthukrishnan, Süleyman Cenk Sahinalp:
  An efficient algorithm for sequence comparison with block reversals. Theor. Comput. Sci. 321(1): 95-101 (2004)
• 
  Gonzalo Navarro, Kimmo Fredriksson:
  Average complexity of exact and approximate multiple string matching. Theor. Comput. Sci. 321(2-3): 283-290 (2004)
• 
  Richard Nock, Frank Nielsen:
  On domain-partitioning induction criteria: worst-case bounds for the worst-case based. Theor. Comput. Sci. 321(2-3): 371-382 (2004)
• 
  Bala Ravikumar:
  Peg-solitaire, string rewriting systems and finite automata. Theor. Comput. Sci. 321(2-3): 383-394 (2004)
• 
  Cláudia Linhares Sales, Frédéric Maffray:
  On dart-free perfectly contractile graphs. Theor. Comput. Sci. 321(2-3): 171-194 (2004)
• 
  Hadas Shachnai, Tami Tamir:
  Tight bounds for online class-constrained packing. Theor. Comput. Sci. 321(1): 103-123 (2004)
• 
  Brett Stevens, Eric Mendelsohn:
  Packing arrays. Theor. Comput. Sci. 321(1): 125-148 (2004)
• 
  Mario Szegedy, Xiaomin Chen:
  Computing Boolean functions from multiple faulty copies of input bits. Theor. Comput. Sci. 321(1): 149-170 (2004)
• 
  Gerhard J. Woeginger:
  Seventeen lines and one-hundred-and-one points. Theor. Comput. Sci. 321(2-3): 415-421 (2004)