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

• 2010
• 
  Adam R. Day:
  On Process Complexity. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  András Faragó:
  On the Structure of Classes of Random Graphs. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Sumit Ganguly:
  Distributing Frequency-Dependent Data Stream Computations. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Marats Golovkins, Jean-Eric Pin:
  Varieties Generated by Certain Models of Reversible Finite Automata. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting:
  An Algorithm for Affine Approximation of Binary Decision Diagrams. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
  Longest Paths in Planar DAGs in Unambiguous Log-Space. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
  An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  David A. Meyer, James Pommersheim:
  Single-Query Learning from Abelian and Non-Abelian Hamming Distance Oracles. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Ashley Montanaro, Tobias Osborne:
  Quantum boolean functions. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Koji Nakazawa, Makoto Tatsuta:
  Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  David J. Pearce, Gary Haggard, Gordon F. Royle:
  Edge-Selection Heuristics for Computing Tutte Polynomials. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Martin Tancer:
  d-collapsibility is NP-complete for d greater or equal to 4. Chic. J. Theor. Comput. Sci. 2010 (2010)
• 
  Mark Utting, Petra Malik, Ian Toyn:
  Transformation Rules for Z. Chic. J. Theor. Comput. Sci. 2010 (2010)