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

• 2020
• 
  Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
  On the concurrent computational content of intermediate logics. Theor. Comput. Sci. 813: 375-409 (2020)
• 
  Patrick Baillot, Alexis Ghyselen:
  Combining linear logic and size types for implicit complexity. Theor. Comput. Sci. 813: 70-99 (2020)
• 
  David Barozzini, David de Frutos-Escrig, Dario Della Monica, Angelo Montanari, Pietro Sala:
  Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts. Theor. Comput. Sci. 813: 270-304 (2020)
• 
  Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
  On the initialization of clocks in timed formalisms. Theor. Comput. Sci. 813: 175-198 (2020)
• 
  Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
  Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+. Theor. Comput. Sci. 813: 428-451 (2020)
• 
  Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
  Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813: 305-326 (2020)
• 
  Laura Bozzelli, Aniello Murano, Loredana Sorrentino:
  Alternating-time temporal logics with linear past. Theor. Comput. Sci. 813: 199-217 (2020)
• 
  Valentina Castiglioni, Michele Loreti, Simone Tini:
  The metric linear-time branching-time spectrum on nondeterministic probabilistic processes. Theor. Comput. Sci. 813: 20-69 (2020)
• 
  Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux:
  On the efficiency of normal form systems for representing Boolean functions. Theor. Comput. Sci. 813: 341-361 (2020)
• 
  Ken-etsu Fujita:
  A formal system of reduction paths for parallel reduction. Theor. Comput. Sci. 813: 327-340 (2020)
• 
  Laura Giordano, Alberto Policriti:
  Adding the power-set to description logics. Theor. Comput. Sci. 813: 155-174 (2020)
• 
  Bruce M. Kapron, Florian Steinberg:
  Type-two polynomial-time and restricted lookahead. Theor. Comput. Sci. 813: 1-19 (2020)
• 
  Daniel Kernberger, Martin Lange:
  On the expressive power of hybrid branching-time logics. Theor. Comput. Sci. 813: 362-374 (2020)
• 
  Ugo Dal Lago, Francesco Gavazzo, Ryo Tanaka:
  Effectful applicative similarity for call-by-name lambda calculi. Theor. Comput. Sci. 813: 234-247 (2020)
• 
  Ugo Dal Lago, Gabriele Vanoni:
  On randomised strategies in the λ-calculus. Theor. Comput. Sci. 813: 100-116 (2020)
• 
  Olivier Laurent:
  Polynomial time in untyped elementary linear logic. Theor. Comput. Sci. 813: 117-142 (2020)
• 
  Armando B. Matos, Luca Paolini, Luca Roversi:
  The fixed point problem of a simple reversible language. Theor. Comput. Sci. 813: 143-154 (2020)
• 
  Luca Paolini, Mauro Piccolo, Luca Roversi:
  A class of Recursive Permutations which is Primitive Recursive complete. Theor. Comput. Sci. 813: 218-233 (2020)
• 
  Luca Spalazzi, Francesco Spegni:
  Parameterized model checking of networks of timed automata with Boolean guards. Theor. Comput. Sci. 813: 248-269 (2020)
• 
  Longchun Wang, Qingguo Li:
  A logic for Lawson compact algebraic L-domains. Theor. Comput. Sci. 813: 410-427 (2020)