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

• 2006
• 
  Gianluigi Bellin, Martin Hyland, Edmund Robinson, Christian Urban:
  Categorical proof theory of classical propositional calculus. Theor. Comput. Sci. 364(2): 146-165 (2006)
• 
  Frédéric Besson, Thomas P. Jensen, David Pichardie:
  Proof-carrying code from certified abstract interpretation and fixpoint compression. Theor. Comput. Sci. 364(3): 273-291 (2006)
• 
  Dominique Cansell, Dominique Méry:
  Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm. Theor. Comput. Sci. 364(3): 318-337 (2006)
• 
  John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
  Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. 364(1): 115-131 (2006)
• 
  Thomas Ehrhard, Laurent Regnier:
  Differential interaction nets. Theor. Comput. Sci. 364(2): 166-195 (2006)
• 
  Olivier Finkel:
  On decidability properties of local sentences. Theor. Comput. Sci. 364(2): 196-211 (2006)
• 
  Ricard Gavaldà, Eiji Takimoto:
  Foreword. Theor. Comput. Sci. 364(1): 1-2 (2006)
• 
  Sven Hartmann, Sebastian Link:
  Deciding implication for functional dependencies in complex-value databases. Theor. Comput. Sci. 364(2): 212-240 (2006)
• 
  Martin Hofmann, Hans-Wolfgang Loidl:
  Preface. Theor. Comput. Sci. 364(3): 271-272 (2006)
• 
  Marcus Hutter:
  On generalized computable universal priors and their convergence. Theor. Comput. Sci. 364(1): 27-41 (2006)
• 
  Michael Kaminski, Julia Rubin-Mosin:
  Default theories over monadic languages. Theor. Comput. Sci. 364(2): 241-253 (2006)
• 
  Andrew Kennedy:
  Securing the .NET programming model. Theor. Comput. Sci. 364(3): 311-317 (2006)
• 
  Genshiro Kitagawa:
  Signal extraction and knowledge discovery based on statistical modeling. Theor. Comput. Sci. 364(1): 132-142 (2006)
• 
  Peeter Laud, Tarmo Uustalu, Varmo Vene:
  Type systems equivalent to data-flow analyses for imperative languages. Theor. Comput. Sci. 364(3): 292-310 (2006)
• 
  Eric Martin, Arun Sharma, Frank Stephan:
  On ordinal VC-dimension and some notions of complexity. Theor. Comput. Sci. 364(1): 62-76 (2006)
• 
  Joachim Niehren, Jan Schwinghammer, Gert Smolka:
  A concurrent lambda calculus with futures. Theor. Comput. Sci. 364(3): 338-356 (2006)
• 
  Ilia Nouretdinov, Vladimir Vovk:
  Criterion of calibration for transductive confidence machine with limited feedback. Theor. Comput. Sci. 364(1): 3-9 (2006)
• 
  John Power:
  Generic models for computational effects. Theor. Comput. Sci. 364(2): 254-269 (2006)
• 
  Ruy J. G. B. de Queiroz, Patrick Cégielski:
  Preface. Theor. Comput. Sci. 364(2): 143-145 (2006)
• 
  Jin Uemura, Masako Sato:
  Learning of erasing primitive formal systems from positive examples. Theor. Comput. Sci. 364(1): 98-114 (2006)
• 
  Vladimir Vovk:
  Well-calibrated predictions from on-line compression models. Theor. Comput. Sci. 364(1): 10-26 (2006)
• 
  Thomas Zeugmann:
  From learning in the limit to stochastic finite learning. Theor. Comput. Sci. 364(1): 77-97 (2006)
• 
  Sandra Zilles:
  An approach to intrinsic complexity of uniform learning. Theor. Comput. Sci. 364(1): 42-61 (2006)