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

• 2010
• 
  Farid M. Ablayev, Svetlana Ablayeva:
  A Communication Approach to the Superposition Problem. Fundam. Informaticae 104(3): 185-200 (2010)
• 
  Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel:
  A Note on a priori Estimations of Classification Circuit Complexity. Fundam. Informaticae 104(3): 201-217 (2010)
• 
  Marina An. Alekhina:
  Synthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates. Fundam. Informaticae 104(3): 219-225 (2010)
• 
  Maria Paola Bianchi, Beatrice Palano:
  Behaviours of Unary Quantum Automata. Fundam. Informaticae 104(1-2): 1-15 (2010)
• 
  Peter Cerno, Frantisek Mráz:
  Clearing Restarting Automata. Fundam. Informaticae 104(1-2): 17-54 (2010)
• 
  Richard Dapoigny, Patrick Barlatier:
  Modeling Contexts with Dependent Types. Fundam. Informaticae 104(4): 293-327 (2010)
• 
  Sergej B. Gashkov, Igor Gashkov:
  Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields. Fundam. Informaticae 104(3): 227-238 (2010)
• 
  Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti:
  One Pebble Versus epsilon * log n Bits. Fundam. Informaticae 104(1-2): 55-69 (2010)
• 
  Juraj Hromkovic, Borislav Suster, Eduard Toman:
  Preface. Fundam. Informaticae 104(3) (2010)
• 
  Artur Jez, Alexander Okhotin:
  Univariate Equations Over Sets of Natural Numbers. Fundam. Informaticae 104(4): 329-348 (2010)
• 
  Peter Leupold, Benedek Nagy:
  5' -> 3' Watson-Crick AutomataWith Several Runs. Fundam. Informaticae 104(1-2): 71-91 (2010)
• 
  Sergei A. Lozhkin, Alexander E. Shiganov:
  High Accuracy Asymptotic Bounds on the BDD Size and Weight of the Hardest Functions. Fundam. Informaticae 104(3): 239-253 (2010)
• 
  Gema M. Martín, Francisco J. Vico, Jürgen Dassow, Bianca Truthe:
  Low Disruption Transformations on Cyclic Automata. Fundam. Informaticae 104(1-2): 93-110 (2010)
• 
  Tomás Masopust:
  Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. Fundam. Informaticae 104(1-2): 111-124 (2010)
• 
  Boris Melnikov:
  Extended Nondeterministic Finite Automata. Fundam. Informaticae 104(3): 255-265 (2010)
• 
  Boris Melnikov:
  Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems. Fundam. Informaticae 104(3): 267-283 (2010)
• 
  Mikhail Ju. Moshkov:
  Greedy Algorithm with Weights for Decision Tree Construction. Fundam. Informaticae 104(3): 285-292 (2010)
• 
  Linh Anh Nguyen:
  Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity. Fundam. Informaticae 104(4): 349-384 (2010)
• 
  Hidenosuke Nishio:
  Automorphissm Classification of Cellular Automata. Fundam. Informaticae 104(1-2): 125-140 (2010)
• 
  Zuhua Shao:
  Breaking Pomykala-Barabasz Threshold Proxy Signature Scheme. Fundam. Informaticae 104(4): 385-392 (2010)
• 
  Klaus Sutner:
  Cellular Automata, Decidability and Phasespace. Fundam. Informaticae 104(1-2): 141-160 (2010)
• 
  Bianca Truthe:
  Target Based Accepting Networks of Evolutionary Processors. Fundam. Informaticae 104(1-2): 161-183 (2010)