• 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

• 2019
• 
  Rosa Abbasi, Fatemeh Ghassemi, Ramtin Khosravi:
  Verification of asynchronous systems with an unspecified component. Acta Informatica 56(2): 161-203 (2019)
• 
  Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh:
  Parikh matrices for powers of words. Acta Informatica 56(6): 521-535 (2019)
• 
  Paolo Baldan, Fabio Gadducci:
  Petri nets are dioids: a new algebraic foundation for non-deterministic net theory. Acta Informatica 56(1): 61-92 (2019)
• 
  Soumyadip Bandyopadhyay, Dipankar Sarkar, Chittaranjan Mandal:
  Equivalence checking of Petri net models of programs using static and dynamic cut-points. Acta Informatica 56(4): 321-383 (2019)
• 
  Paul S. Bonsma, Daniël Paulusma:
  Using contracted solution graphs for solving reconfiguration problems. Acta Informatica 56(7-8): 619-648 (2019)
• 
  Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Paola Giannini:
  Reversible sessions with flexible choices. Acta Informatica 56(7-8): 553-583 (2019)
• 
  Pietro Cenciarelli, Daniele Gorla, Ivano Salvo:
  Depletable channels: dynamics, behaviour, and efficiency in network design. Acta Informatica 56(5): 405-431 (2019)
• 
  Huiyan Chen, Chenchen Zhang:
  Identity-based signatures in standard model. Acta Informatica 56(6): 471-486 (2019)
• 
  Jörg Desel, Javier Esparza, Philipp Hoffmann:
  Negotiation as concurrency primitive. Acta Informatica 56(2): 93-159 (2019)
• 
  Masoud Ebrahimi, Gholamreza Sotudeh, Ali Movaghar:
  Symbolic checking of Fuzzy CTL on Fuzzy Program Graph. Acta Informatica 56(1): 1-33 (2019)
• 
  Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem:
  Red-black trees with constant update time. Acta Informatica 56(5): 391-404 (2019)
• 
  Sascha Fendrich, Gerald Lüttgen:
  A generalised theory of Interface Automata, component compatibility and error. Acta Informatica 56(4): 287-319 (2019)
• 
  Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
  On path-controlled insertion-deletion systems. Acta Informatica 56(1): 35-59 (2019)
• 
  Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
  Nested antichains for WS1S. Acta Informatica 56(3): 205-228 (2019)
• 
  Zoltán Fülöp, Heiko Vogler:
  Weighted iterated linear control. Acta Informatica 56(5): 447-469 (2019)
• 
  Petr Jancar, David Purser:
  Structural liveness of Petri nets is ExpSpace-hard and decidable. Acta Informatica 56(6): 537-552 (2019)
• 
  Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
  On the hardness of analyzing probabilistic programs. Acta Informatica 56(3): 255-285 (2019)
• 
  Andreas Krebs, Arne Meier, Martin Mundhenk:
  The model checking fingerprints of CTL operators. Acta Informatica 56(6): 487-519 (2019)
• 
  David Monniaux:
  On the decidability of the existence of polyhedral invariants in transition systems. Acta Informatica 56(4): 385-389 (2019)
• 
  Wolfgang Reisig:
  Associative composition of components with double-sided interfaces. Acta Informatica 56(3): 229-253 (2019)
• 
  Jurriaan Rot:
  Distributive laws for monotone specifications. Acta Informatica 56(7-8): 585-617 (2019)
• 
  Sathyanarayanan Srinivasan, Ramesh Kandukoori:
  A Paxos based algorithm to minimize the overhead of process recovery in consensus. Acta Informatica 56(5): 433-446 (2019)