• 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

• 1983
• 
  Herman Akdag:
  Performances of an Algorithm Constructing a Nearly Optimal Binary Tree. Acta Informatica 20: 121-132 (1983)
• 
  Joseph A. Bannister, Kishor S. Trivedi:
  Task Allocation in Fault-Tolerant Distributed Systems. Acta Informatica 20: 261-281 (1983)
• 
  Mordechai Ben-Ari, Amir Pnueli, Zohar Manna:
  The Temporal Logic of Branching Time. Acta Informatica 20: 207-226 (1983)
• 
  Walter Bucher:
  Two-Symbol DOS Systems Generating Regular Languages. Acta Informatica 20: 133-142 (1983)
• 
  Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks:
  On Sets of Boolean n -Projections Surjective. Acta Informatica 20: 103-111 (1983)
• 
  Mario Coppo:
  On the Semantics of Polymorphism. Acta Informatica 20: 159-170 (1983)
• 
  Werner Damm, Bernhard Josko:
  A Sound and Relatively * Complete Hoare-Logic for a Language With Higher Type Procedures. Acta Informatica 20: 59-101 (1983)
• 
  Philippe Flajolet:
  On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Informatica 20: 345-369 (1983)
• 
  Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl:
  Is Text Compression by Prefixes and Suffixes Practical? Acta Informatica 20: 371-389 (1983)
• 
  Nissim Francez:
  Product Properties and Their Direct Verification. Acta Informatica 20: 329-344 (1983)
• 
  Nathan Goodman, Oded Shmueli:
  NP-complete Problems Simplified on Tree Schemas. Acta Informatica 20: 171-178 (1983)
• 
  Jifeng He:
  General Predicate Transformer and the Semantics of a Programming Language With Go To Statement. Acta Informatica 20: 35-57 (1983)
• 
  Hisao Kameda:
  A Note on Multi-queue Scheduling of Two Tasks. Acta Informatica 20: 113-120 (1983)
• 
  H. C. M. Kleijn, Grzegorz Rozenberg:
  On the Generative Power of Regular Pattern Grammars. Acta Informatica 20: 391-411 (1983)
• 
  Heikki Mannila, Kari-Jouko Räihä:
  On the Relationship of Minimum and Optimum Covers for a Set of Functional Dependencies. Acta Informatica 20: 143-158 (1983)
• 
  G. Marque-Pucheu:
  Rational Set of Trees and the Algebraic Semantics of Logic Programming. Acta Informatica 20: 249-260 (1983)
• 
  Alain J. Martin:
  A General Proof Rule for Procedures in Predicate Transformer Semantics. Acta Informatica 20: 301-313 (1983)
• 
  Ali Mili:
  A Relational Approach to the Design of Deterministic Programs. Acta Informatica 20: 315-328 (1983)
• 
  Jean-Jacques Pansiot:
  Hiérarchie et fermeture de certaines classes de tag-systèmes. Acta Informatica 20: 179-196 (1983)
• 
  Werner Pohlmann:
  LR Parsing for Affix Grammars. Acta Informatica 20: 283-300 (1983)
• 
  Christian Ronse:
  A Three-Stage Construction for Multiconnection Networks. Acta Informatica 20: 197-206 (1983)
• 
  Hans Ulrich Simon:
  Pattern Matching in Trees and Nets. Acta Informatica 20: 227-248 (1983)
• 
  Martin Wirsing, Peter Pepper, Helmuth Partsch, Walter Dosch:
  On Hierarchies of Abstract Data Types. Acta Informatica 20: 1-33 (1983)