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

• 2003
• 
  Martín Abadi, Bruno Blanchet:
  Secrecy types for asymmetric communication. Theor. Comput. Sci. 298(3): 387-415 (2003)
• 
  Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
  Equational theories of tropical semirings. Theor. Comput. Sci. 298(3): 417-469 (2003)
• 
  Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano:
  Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model. Theor. Comput. Sci. 298(1): 235-251 (2003)
• 
  Michel Bidoit, Rolf Hennicker, Alexander Kurz:
  Observational logic, constructor-based logic, and their duality. Theor. Comput. Sci. 298(3): 471-510 (2003)
• 
  Mikolaj Bojanczyk:
  The finite graph problem for two-way alternating automata. Theor. Comput. Sci. 298(3): 511-528 (2003)
• 
  Nadia Busi, Gianluigi Zavattaro:
  Expired data collection in shared dataspaces. Theor. Comput. Sci. 298(3): 529-556 (2003)
• 
  Cristiano Calcagno, Peter W. O'Hearn, Richard Bornat:
  Program logic and equivalence in the presence of garbage collection. Theor. Comput. Sci. 298(3): 557-581 (2003)
• 
  Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
  Infinitary lambda calculus and discrimination of Berarducci trees. Theor. Comput. Sci. 298(2): 275-302 (2003)
• 
  Rodney G. Downey, Lance Fortnow:
  Uniformly hard languages. Theor. Comput. Sci. 298(2): 303-315 (2003)
• 
  Michael R. Fellows, Catherine McCartin:
  On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 298(2): 317-324 (2003)
• 
  Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
  On learning of functions refutably. Theor. Comput. Sci. 298(1): 111-143 (2003)
• 
  Bakhadyr Khoussainov:
  On algebraic and logical specifications of classes of regular languages. Theor. Comput. Sci. 298(2): 325-346 (2003)
• 
  Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
  Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 298(1): 253-272 (2003)
• 
  Gerwin Klein, Tobias Nipkow:
  Verified bytecode verifiers. Theor. Comput. Sci. 298(3): 583-626 (2003)
• 
  Padmanabhan Krishnan:
  Automatic synthesis of a subclass of schedulers in timed systems. Theor. Comput. Sci. 298(2): 347-363 (2003)
• 
  Steffen Lange, Gunter Grieser, Klaus P. Jantke:
  Advanced elementary formal systems. Theor. Comput. Sci. 298(1): 51-70 (2003)
• 
  Steffen Lange, Jochen Nessel:
  Decision lists over regular patterns. Theor. Comput. Sci. 298(1): 71-87 (2003)
• 
  Eric Martin, Arun Sharma, Frank Stephan:
  Learning power and language expressiveness. Theor. Comput. Sci. 298(2): 365-383 (2003)
• 
  Wolfgang Merkle, Frank Stephan:
  Refuting learning revisited. Theor. Comput. Sci. 298(1): 145-177 (2003)
• 
  Yasuhito Mukouchi, Masako Sato:
  Refutable language learning with a neighbor system. Theor. Comput. Sci. 298(1): 89-110 (2003)
• 
  Seishi Okamoto, Nobuhiro Yugami:
  Effects of domain characteristics on instance-based learning algorithms. Theor. Comput. Sci. 298(1): 207-233 (2003)
• 
  Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura:
  Learning elementary formal systems with queries. Theor. Comput. Sci. 298(1): 21-50 (2003)
• 
  Akihiro Yamamoto:
  Hypothesis finding based on upward refinement of residue hypotheses. Theor. Comput. Sci. 298(1): 5-19 (2003)
• 
  Takashi Yokomori:
  Polynomial-time identification of very simple grammars from positive data. Theor. Comput. Sci. 298(1): 179-206 (2003)