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

• 2006
• 
  Kazuyuki Amano, Akira Maruoka:
  On learning monotone Boolean functions under the uniform distribution. Theor. Comput. Sci. 350(1): 3-12 (2006)
• 
  Mikolaj Bojanczyk, Thomas Colcombet:
  Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2-3): 164-173 (2006)
• 
  Nader H. Bshouty, Lynn Burroughs:
  Maximizing agreements and coagnostic learning. Theor. Comput. Sci. 350(1): 24-39 (2006)
• 
  Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann:
  Foreword. Theor. Comput. Sci. 350(1): 1-2 (2006)
• 
  Anuj Dawar, Erich Grädel, Stephan Kreutzer:
  Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006)
• 
  Yuxin Deng, Davide Sangiorgi:
  Towards an algebraic theory of typed mobile processes. Theor. Comput. Sci. 350(2-3): 188-212 (2006)
• 
  Claudia Faggian:
  Interactive observability in Ludics: The geometry of tests. Theor. Comput. Sci. 350(2-3): 213-233 (2006)
• 
  Jürgen Forster, Hans Ulrich Simon:
  On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci. 350(1): 40-48 (2006)
• 
  Bertram Fronhöfer, Akihiro Yamamoto:
  Hypothesis finding with proof theoretical appropriateness criteria. Theor. Comput. Sci. 350(1): 140-162 (2006)
• 
  Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
  Syntactic control of concurrency. Theor. Comput. Sci. 350(2-3): 234-251 (2006)
• 
  Esfandiar Haghverdi, Philip J. Scott:
  A categorical model for the geometry of interaction. Theor. Comput. Sci. 350(2-3): 252-274 (2006)
• 
  Susumu Hayashi:
  Mathematics based on incremental learning - Excluded middle and inductive inference. Theor. Comput. Sci. 350(1): 125-139 (2006)
• 
  Johannes Köbler, Wolfgang Lindner:
  The complexity of learning concept classes with polynomial general dimension. Theor. Comput. Sci. 350(1): 49-62 (2006)
• 
  Jack A. Laird:
  A calculus of coroutines. Theor. Comput. Sci. 350(2-3): 275-291 (2006)
• 
  Keye Martin:
  Entropy as a fixed point. Theor. Comput. Sci. 350(2-3): 292-324 (2006)
• 
  Eric Martin, Arun Sharma, Frank Stephan:
  Unifying logic, topology and learning in Parametric logic. Theor. Comput. Sci. 350(1): 103-124 (2006)
• 
  Daniel Reidenbach:
  A non-learnable class of E-pattern languages. Theor. Comput. Sci. 350(1): 91-102 (2006)
• 
  Donald Sannella:
  Preface. Theor. Comput. Sci. 350(2-3): 163 (2006)
• 
  Nicole Schweikardt:
  On the expressive power of monadic least fixed point logic. Theor. Comput. Sci. 350(2-3): 325-344 (2006)
• 
  Olivier Serre:
  Games with winning conditions of high Borel complexity. Theor. Comput. Sci. 350(2-3): 345-372 (2006)
• 
  Rocco A. Servedio:
  On learning embedded midbit functions. Theor. Comput. Sci. 350(1): 13-23 (2006)
• 
  Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
  Ordered term tree languages which are polynomial time inductively inferable from positive data. Theor. Comput. Sci. 350(1): 63-90 (2006)