• 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

• 2002
• 
  Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Luca Tesei:
  A Notion of Non-Interference for Timed Automata. Fundam. Informaticae 51(1-2): 1-11 (2002)
• 
  Verónica Becher, Gregory J. Chaitin:
  Another Example of Higher Order Randomness. Fundam. Informaticae 51(4): 325-338 (2002)
• 
  Viviana Bono, Jerzy Tiuryn:
  Products and Polymorphic Subtypes. Fundam. Informaticae 51(1-2): 13-41 (2002)
• 
  Hans-Dieter Burkhard:
  Real Time Control for Autonomous Mobile Robots. Fundam. Informaticae 51(3): 251-270 (2002)
• 
  Ludwik Czaja:
  Place/Transition Petri Net Evolutions: Recording Ways, Analysis and Synthesis. Fundam. Informaticae 51(1-2): 43-58 (2002)
• 
  Piotr Dembinski, Wojciech Penczek, Agata Pólrola:
  Verification of Timed Automata Based on Similarity. Fundam. Informaticae 51(1-2): 59-89 (2002)
• 
  François Denis, Aurélien Lemay, Alain Terlutte:
  Residual Finite State Automata. Fundam. Informaticae 51(4): 339-368 (2002)
• 
  Barbara Dunin-Keplicz, Rineke Verbrugge:
  Collective Intentions. Fundam. Informaticae 51(3): 271-295 (2002)
• 
  Berndt Farwer:
  Dynamic Modification of Object Petri Nets. An Application to Modelling Protocols with Fork-Join Structures. Fundam. Informaticae 51(1-2): 91-101 (2002)
• 
  Anna Gomolinska:
  A Comparative Study of Some Generalized Rough Approximations. Fundam. Informaticae 51(1-2): 103-119 (2002)
• 
  Grzegorz Góra, Arkadiusz Wojna:
  RIONA: A New Classification System Combining Rule Induction and Instance-Based Learning. Fundam. Informaticae 51(4): 369-390 (2002)
• 
  Ivan Kopeek, Miroslav Novotný:
  On Equations Including Strings. Fundam. Informaticae 51(4): 391-398 (2002)
• 
  Costas D. Koutras, Pavlos Peppas:
  Weaker Axioms, More Ranges. Fundam. Informaticae 51(3): 297-310 (2002)
• 
  Irina A. Lomazova:
  Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets. Fundam. Informaticae 51(1-2): 121-133 (2002)
• 
  Alexander Meduna, Duwan Koláq:
  One-Turn Regulated Pushdown Automata and Their Reduction. Fundam. Informaticae 51(4): 399-405 (2002)
• 
  Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny:
  Bounded Model Checking for the Universal Fragment of CTL. Fundam. Informaticae 51(1-2): 135-156 (2002)
• 
  James F. Peters, Andrzej Skowron, Jaroslaw Stepaniuk, Sheela Ramanna:
  Towards an Ontology of Approximate Reason. Fundam. Informaticae 51(1-2): 157-173 (2002)
• 
  Zbigniew W. Ras, Shishir Gupta:
  Global Action Rules in Distributed Knowledge Systems. Fundam. Informaticae 51(1-2): 175-184 (2002)
• 
  Jan Richling, Louchka Popova-Zeugmann, Matthias Werner:
  Verification of Non-functional Properties of a Composable Architecture with Petrinets. Fundam. Informaticae 51(1-2): 185-200 (2002)
• 
  Jayanta Sen, Mihir K. Chakraborty:
  A Study of Interconnections Between Rough and 3-Valued Lukasiewicz Logics. Fundam. Informaticae 51(3): 311-324 (2002)
• 
  Zbigniew Suraj, James F. Peters, W. Rzqsa:
  A Comparison of Different Decision Algorithms Used in Volumetric Storm Cells Classification. Fundam. Informaticae 51(1-2): 201-214 (2002)
• 
  Kimmo Varpaaniemi:
  Minimizing the Number of Successor States in the Stubborn Set Method. Fundam. Informaticae 51(1-2): 215-234 (2002)
• 
  Józef Winkowski:
  Reachability in Contextual Nets. Fundam. Informaticae 51(1-2): 235-250 (2002)