• 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

• 1979
• 
  Colin Adams, Erol Gelenbe, Jean Vicard:
  An Experimentally Validated Model of the Paging Drum. Acta Informatica 11: 103-117 (1979)
• 
  Michael A. Arbib, Suad Alagic:
  Proof Rules for Gotos. Acta Informatica 11: 139-148 (1979)
• 
  Peter R. J. Asveld, Joost Engelfriet:
  Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. Acta Informatica 11: 259-285 (1979)
• 
  Jean-Michel Autebert:
  Opérations de Cylindre et applications séquentielles gauches inverses. Acta Informatica 11: 241-258 (1979)
• 
  P. Bouchet:
  Procédures de reprise dans les systèmes de gestion de base de données réparties. Acta Informatica 11: 305-340 (1979)
• 
  Derek Coleman, Jane W. Hughes:
  The Clean Termination of Pascal Programs. Acta Informatica 11: 195-210 (1979)
• 
  David Gries:
  The Schorr-Waite Graph Marking Algorithm. Acta Informatica 11: 223-232 (1979)
• 
  Eric C. R. Hehner:
  do Considered od: A Contribution to the Programming Calculus. Acta Informatica 11: 287-304 (1979)
• 
  Stephan Heilbrunner:
  On the Definition of ELR(k) and ELL(k) Grammars. Acta Informatica 11: 169-176 (1979)
• 
  Cliff B. Jones:
  Constructing a Theory of a Data Structure as an Aid to Program Development. Acta Informatica 11: 119-137 (1979)
• 
  Rainer Kemp:
  The Average Number of Registers Needed to Evaluate a Binary Tree Optimally. Acta Informatica 11: 363-372 (1979)
• 
  Wilf R. LaLonde:
  Constructing LR Parsers for Regular Right Part Grammars. Acta Informatica 11: 177-193 (1979)
• 
  Michel Latteux:
  Intersections de langages algébriques bornés. Acta Informatica 11: 233-240 (1979)
• 
  Jan van Leeuwen:
  A Useful Lemma for Context-Free Programmed Grammars. Acta Informatica 11: 373-386 (1979)
• 
  Wolfgang Merzenich:
  A Binary Operation on Trees and an Initial Algebra Characterization for Finite Tree Types. Acta Informatica 11: 149-168 (1979)
• 
  Rodney W. Topor:
  The Correctness of the Schorr-Waite List Marking Algorithm. Acta Informatica 11: 211-221 (1979)
• 
  Karl Unterauer:
  Dynamic Weighted Binary Search Trees. Acta Informatica 11: 341-362 (1979)
• 1978
• 
  Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo:
  Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica 11: 61-77 (1978)
• 
  John Darlington:
  A Synthesis of Several Sorting Algorithms. Acta Informatica 11: 1-30 (1978)
• 
  Seymour Ginsburg, Derick Wood:
  Precedence Relations in Grammar Forms. Acta Informatica 11: 79-88 (1978)
• 
  Sheila A. Greibach:
  Hierarchy Theorems for Two-Way Finite State Transducers. Acta Informatica 11: 80-101 (1978)
• 
  Gérard P. Huet, Bernard Lang:
  Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Informatica 11: 31-55 (1978)
• 
  Abraham Silberschatz, Brian Johnson:
  Remarks on "Some Comments on Concurrent Readers and Writers" by Reidar Conradi. Acta Informatica 11: 57-60 (1978)