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

• 2019
• 
  Yehia Abd Alrahman, Rocco De Nicola, Michele Loreti:
  A calculus for collective-adaptive systems and its behavioural theory. Inf. Comput. 268 (2019)
• 
  Mike Amato:
  Introducing article numbering to Information and Computation. Inf. Comput. 268 (2019)
• 
  Ahmed A. Belal, Amr Elmasry:
  Optimal prefix codes with fewer distinct codeword lengths are faster to construct. Inf. Comput. 268 (2019)
• 
  Olaf Beyersdorff, Luke Hinde:
  Characterising tree-like Frege proofs for QBF. Inf. Comput. 268 (2019)
• 
  Andrei A. Bulatov:
  Constraint Satisfaction Problems over semilattice block Mal'tsev algebras. Inf. Comput. 268 (2019)
• 
  Valentina Castiglioni, Simone Tini:
  Logical characterization of branching metrics for nondeterministic probabilistic transition systems. Inf. Comput. 268 (2019)
• 
  Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
  Optimal bounds for computing α-gapped repeats. Inf. Comput. 268 (2019)
• 
  Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
  Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes. Inf. Comput. 268 (2019)
• 
  Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
  Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. Inf. Comput. 268 (2019)
• 
  Mingzhang Huang, Hongfei Fu, Joost-Pieter Katoen:
  Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems. Inf. Comput. 268 (2019)
• 
  Dimitrios Kouzapas, Jorge A. Pérez, Nobuko Yoshida:
  On the relative expressiveness of higher-order session processes. Inf. Comput. 268 (2019)
• 
  Tero Laihonen:
  On t-revealing codes in binary Hamming spaces. Inf. Comput. 268 (2019)