• 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

• 2013
• 
  Clint J. van Alten:
  Partial algebras and complexity of satisfiability and universal theory for distributive lattices, boolean algebras and Heyting algebras. Theor. Comput. Sci. 501: 82-92 (2013)
• 
  Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
  One-round multi-party communication complexity of distinguishing sums. Theor. Comput. Sci. 501: 101-108 (2013)
• 
  Christoph Behle, Andreas Krebs, Mark Mercer:
  Linear circuits, two-variable logic and weakly blocked monoids. Theor. Comput. Sci. 501: 20-33 (2013)
• 
  Amy Glen, Jamie Simpson:
  The total run length of a word. Theor. Comput. Sci. 501: 41-48 (2013)
• 
  Wenqi Huang, Kun He:
  On the weak computability of a four dimensional orthogonal packing and time scheduling problem. Theor. Comput. Sci. 501: 1-10 (2013)
• 
  Oscar H. Ibarra, Shinnosuke Seki:
  On the open problem of Ginsburg concerning semilinear sets and related problems. Theor. Comput. Sci. 501: 11-19 (2013)
• 
  Lee Klingler, Rainer Steinwandt, Dominique Unruh:
  On using probabilistic Turing machines to model participants in cryptographic protocols. Theor. Comput. Sci. 501: 49-51 (2013)
• 
  Indra Rajasingh, Bharati Rajan, Albert Muthumalai, A. S. Shanthi:
  On excessive index of certain networks. Theor. Comput. Sci. 501: 34-40 (2013)
• 
  Violeta Tomasevic, Milo Tomasevic:
  An analysis of chain characteristics in the cryptanalytic TMTO method. Theor. Comput. Sci. 501: 52-61 (2013)
• 
  Chang-Hsiung Tsai, Jheng-Cheng Chen:
  Fault isolation and identification in general biswapped networks under the PMC diagnostic model. Theor. Comput. Sci. 501: 62-71 (2013)
• 
  Nodari Vakhania, Frank Werner:
  Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time. Theor. Comput. Sci. 501: 72-81 (2013)
• 
  Paul M. B. Vitányi:
  Conditional Kolmogorov complexity and universal probability. Theor. Comput. Sci. 501: 93-100 (2013)