• 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

• 2008
• 
  Hila Amir-Kroll, Avital Sadot, Irun R. Cohen, David Harel:
  GemCell: A generic platform for modeling multi-cellular biological systems. Theor. Comput. Sci. 391(3): 276-290 (2008)
• 
  Paul Bell, Igor Potapov:
  On undecidability bounds for matrix decision problems. Theor. Comput. Sci. 391(1-2): 3-13 (2008)
• 
  Julien Bernat:
  Symmetrized beta-integers. Theor. Comput. Sci. 391(1-2): 164-177 (2008)
• 
  Valérie Berthé, Pierre B. A. Lecomte, Michel Rigo:
  Preface to the special issue dedicated to combinatorics, automata and number theory. Theor. Comput. Sci. 391(1-2): 1-2 (2008)
• 
  Robert Brignall, Nikola Ruskuc, Vincent Vatter:
  Simple permutations: Decidability and unavoidable substructures. Theor. Comput. Sci. 391(1-2): 150-163 (2008)
• 
  Srecko Brlek, Gilbert Labelle, Annie Lacasse:
  Shuffle operations on discrete paths. Theor. Comput. Sci. 391(1-2): 75-89 (2008)
• 
  Luca Cardelli:
  On process rate semantics. Theor. Comput. Sci. 391(3): 190-215 (2008)
• 
  Matteo Cavaliere, Radu Mardare, Sean Sedwards:
  A multiset-based model of synchronizing agents: Computability and robustness. Theor. Comput. Sci. 391(3): 216-238 (2008)
• 
  Elena Czeizler:
  Multiple constraints on three and four words. Theor. Comput. Sci. 391(1-2): 14-19 (2008)
• 
  Fabien Durand:
  Cobham-Semenov theorem and N^d-subshifts. Theor. Comput. Sci. 391(1-2): 20-38 (2008)
• 
  Dirk Frettlöh:
  Self-dual tilings with respect to star-duality. Theor. Comput. Sci. 391(1-2): 39-50 (2008)
• 
  Amy Glen:
  A characterization of fine words over a finite alphabet. Theor. Comput. Sci. 391(1-2): 51-60 (2008)
• 
  John Heath, Marta Z. Kwiatkowska, Gethin Norman, David Parker, Oksana Tymchyshyn:
  Probabilistic model checking of complex biological pathways. Theor. Comput. Sci. 391(3): 239-257 (2008)
• 
  Juha Honkala:
  Cancellation and periodicity properties of iterated morphisms. Theor. Comput. Sci. 391(1-2): 61-64 (2008)
• 
  Jui-Yi Kao, Narad Rampersad, Jeffrey O. Shallit, Manuel Silva:
  Words avoiding repetitions in arithmetic progressions. Theor. Comput. Sci. 391(1-2): 126-137 (2008)
• 
  Christoph Koutschan:
  Regular languages and their generating functions: The inverse problem. Theor. Comput. Sci. 391(1-2): 65-74 (2008)
• 
  Guy Louchard, Helmut Prodinger:
  Generalized approximate counting revisited. Theor. Comput. Sci. 391(1-2): 109-125 (2008)
• 
  Jean Néraud:
  Completing circular codes in regular submonoids. Theor. Comput. Sci. 391(1-2): 90-98 (2008)
• 
  Ilja V. Petrov:
  An algorithm for recognition of n-collapsing words. Theor. Comput. Sci. 391(1-2): 99-108 (2008)
• 
  Corrado Priami:
  Preface. Theor. Comput. Sci. 391(3): 189 (2008)
• 
  S. A. Puzynina, Sergey V. Avgustinovich:
  On periodicity of two-dimensional words. Theor. Comput. Sci. 391(1-2): 178-187 (2008)
• 
  Bernhard Schratzberger:
  A conversion algorithm based on the technique of singularization. Theor. Comput. Sci. 391(1-2): 138-149 (2008)
• 
  Heike Siebert, Alexander Bockmayr:
  Temporal constraints in the logical analysis of regulatory networks. Theor. Comput. Sci. 391(3): 258-275 (2008)