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

• 2001
• 
  Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
  Extended capabilities for visual cryptography. Theor. Comput. Sci. 250(1-2): 143-161 (2001)
• 
  Giorgio Ausiello, Donald Sannella, Michael W. Mislove:
  25 Years. Theor. Comput. Sci. 250(1-2) (2001)
• 
  Judit Bar-Ilan, Guy Kortsarz, David Peleg:
  Generalized submodular cover problems and applications. Theor. Comput. Sci. 250(1-2): 179-200 (2001)
• 
  Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
  A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001)
• 
  Gerth Stølting Brodal, Maria Cristina Pinotti:
  Comparator networks for binary heap construction. Theor. Comput. Sci. 250(1-2): 235-245 (2001)
• 
  Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
  Automatic semigroups. Theor. Comput. Sci. 250(1-2): 365-391 (2001)
• 
  Salvatore Caporaso, Michele Zito, Nicola Galesi:
  A predicative and decidable characterization of the polynomial classes of languages. Theor. Comput. Sci. 250(1-2): 83-99 (2001)
• 
  Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
  Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250(1-2): 201-217 (2001)
• 
  Zoltán Fülöp, Sándor Vágvölgyi:
  Restricted ground tree transducers. Theor. Comput. Sci. 250(1-2): 219-233 (2001)
• 
  Joanna Jedrzejowicz, Andrzej Szepietowski:
  Shuffle languages are in P. Theor. Comput. Sci. 250(1-2): 31-53 (2001)
• 
  Changwook Kim:
  Double Greibach operator grammars. Theor. Comput. Sci. 250(1-2): 247-264 (2001)
• 
  Timo Knuutila:
  Re-describing an algorithm by Hopcroft. Theor. Comput. Sci. 250(1-2): 333-363 (2001)
• 
  Ina Koch:
  Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250(1-2): 1-30 (2001)
• 
  Salah Labhalla, Henri Lombardi, E. Moutai:
  Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact. Theor. Comput. Sci. 250(1-2): 265-332 (2001)
• 
  Wolfgang Merkle:
  Structural properties of bounded relations with an application to NP optimization problems. Theor. Comput. Sci. 250(1-2): 101-124 (2001)
• 
  Valeria Mihalache, Arto Salomaa:
  Language-theoretic aspects of DNA complematarity. Theor. Comput. Sci. 250(1-2): 163-178 (2001)
• 
  Maurice Nivat:
  25 Years. Theor. Comput. Sci. 250(1-2) (2001)
• 
  Satoshi Okawa, Sadaki Hirose:
  Homomorphic characterizations of recursively enumerable languages with very small language classes. Theor. Comput. Sci. 250(1-2): 55-69 (2001)
• 
  Christophe Prieur:
  How to decide continuity of rational functions on infinite words. Theor. Comput. Sci. 250(1-2): 71-82 (2001)