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

• 2001
• 
  Habib Abdulrab, Pavel Goralcik, G. S. Makanin:
  Towards parametrizing word equations. RAIRO Theor. Informatics Appl. 35(4): 331-350 (2001)
• 
  Jean Berstel:
  An Exercise on Fibonacci Representations. RAIRO Theor. Informatics Appl. 35(6): 491-498 (2001)
• 
  Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
  Random Generation for Finitely Ambiguous Context-free Languages. RAIRO Theor. Informatics Appl. 35(6): 499-512 (2001)
• 
  Beate Bollig:
  Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. RAIRO Theor. Informatics Appl. 35(2): 149-162 (2001)
• 
  Jérémie Bourdon, Markus E. Nebel, Brigitte Vallée:
  On the Stack-Size of General Tries. RAIRO Theor. Informatics Appl. 35(2): 163-185 (2001)
• 
  Arturo Carpi, Cristiano Maggi:
  On synchronized sequences and their separators. RAIRO Theor. Informatics Appl. 35(6): 513-524 (2001)
• 
  Olivier Carton, Christian Choffrut:
  Periodicity and roots of transfinite strings. RAIRO Theor. Informatics Appl. 35(6): 525-533 (2001)
• 
  Julien Cassaigne, Juhani Karhumäki, Ján Manuch:
  On Conjugacy of Languages. RAIRO Theor. Informatics Appl. 35(6): 535-550 (2001)
• 
  Andrew Chiu, George I. Davida, Bruce E. Litow:
  Division in logspace-uniform NC¹. RAIRO Theor. Informatics Appl. 35(3): 259-275 (2001)
• 
  Patrizio Cintioli, Riccardo Silvestri:
  The Helping Hierarchy. RAIRO Theor. Informatics Appl. 35(4): 367-377 (2001)
• 
  Corina Cîrstea:
  Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems. RAIRO Theor. Informatics Appl. 35(1): 1-29 (2001)
• 
  A. Veloso da Costa:
  On graph products of automatic monoids. RAIRO Theor. Informatics Appl. 35(5): 403-417 (2001)
• 
  Manuel Delgado:
  Commutative images of rational languages and the Abelian kernel of a monoid. RAIRO Theor. Informatics Appl. 35(5): 419-435 (2001)
• 
  François Denis, Rémi Gilleron:
  PAC Learning under Helpful Distributions. RAIRO Theor. Informatics Appl. 35(2): 129-148 (2001)
• 
  Samir Farkh, Karim Nour:
  Les types de données syntaxiques du système F. RAIRO Theor. Informatics Appl. 35(3): 207-221 (2001)
• 
  Rudolf Grübel, Anke Reimers:
  On the number of iterations required by Von Neumann addition. RAIRO Theor. Informatics Appl. 35(2): 187-206 (2001)
• 
  Yannick Guesnet:
  Maximal circular codes versus maximal codes. RAIRO Theor. Informatics Appl. 35(4): 351-365 (2001)
• 
  Stepan Holub, Juha Kortelainen:
  Linear size test sets for certain commutative languages. RAIRO Theor. Informatics Appl. 35(5): 453-475 (2001)
• 
  Bart Jacobs:
  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study. RAIRO Theor. Informatics Appl. 35(1): 31-59 (2001)
• 
  Joanna Jedrzejowicz, Andrzej Szepietowski:
  On the expressive power of the shuffle operator matched with intersection by regular sets. RAIRO Theor. Informatics Appl. 35(4): 379-388 (2001)
• 
  Jan Johannsen:
  Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits. RAIRO Theor. Informatics Appl. 35(3): 277-286 (2001)
• 
  Werner Kuich, Norbert Sauer:
  Atoms and partial orders of infinite languages. RAIRO Theor. Informatics Appl. 35(4): 389-401 (2001)
• 
  Alair Pereira do Lago, Imre Simon:
  Free Burnside Semigroups. RAIRO Theor. Informatics Appl. 35(6): 579-595 (2001)
• 
  Mark Levene, George Loizou:
  A Generalisation of Entity and Referential Integrity in Relational Databases. RAIRO Theor. Informatics Appl. 35(2): 113-127 (2001)
• 
  Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
  A sharpening of the Parikh mapping. RAIRO Theor. Informatics Appl. 35(6): 551-564 (2001)
• 
  Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
  Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. RAIRO Theor. Informatics Appl. 35(5): 477-490 (2001)
• 
  Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
  Forbidden Factors and Fragment Assembly. RAIRO Theor. Informatics Appl. 35(6): 565-577 (2001)
• 
  Sounaka Mishra, Kripasindhu Sikdar:
  On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. RAIRO Theor. Informatics Appl. 35(3): 287-309 (2001)
• 
  Kenichi Morita, Katsunobu Imai:
  Number-Conserving Reversible Cellular Automata and Their Computation-Universality. RAIRO Theor. Informatics Appl. 35(3): 239-258 (2001)
• 
  Karim Nour:
  Les I-types du système F. RAIRO Theor. Informatics Appl. 35(3): 223-237 (2001)

skipping 5 more matches