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

• 1983
• 
  Rakesh Agrawal, Keith D. Detro:
  An Efficient Incremental LR Parser for Grammars With Epsilon Productions. Acta Informatica 19: 369-376 (1983)
• 
  Jan A. Bergstra, J. Terlouw:
  Standard Model Semantics for DSL A Data Type Specification Language. Acta Informatica 19: 97-113 (1983)
• 
  Mohammed Ahmed El-Affendi, Demetres D. Kouvatsos:
  A Maximum Entropy Analysis of the M/G/ 1 and G/M/ 1 Queueing Systems at Equilibrium. Acta Informatica 19: 339-355 (1983)
• 
  Gregor Engels, Udo Pletat, Hans-Dieter Ehrich:
  An Operational Semantics for Specifications of Abstract Data Types with Error Handling. Acta Informatica 19: 235-253 (1983)
• 
  Gilberto Filé:
  Interpretation and Reduction of Attribute Grammars. Acta Informatica 19: 115-150 (1983)
• 
  Friedhelm Meyer auf der Heide:
  Efficiency of Universal Parallel Computers. Acta Informatica 19: 269-296 (1983)
• 
  Juraj Hromkovic:
  On-Way Multihead Deterministic Finite Automata. Acta Informatica 19: 377-384 (1983)
• 
  Kazuo Iwama:
  The Universe Problem for Unrestricted Flow Languages. Acta Informatica 19: 85-96 (1983)
• 
  John P. Kearns, Mary Lou Soffa:
  The Implementation of Retention in a Coroutine Environment. Acta Informatica 19: 221-233 (1983)
• 
  Peter Klein, Friedhelm Meyer auf der Heide:
  A Lower Time Bound for the Knapsack Problem on Random Access Machines. Acta Informatica 19: 385-395 (1983)
• 
  H. T. Kung, Christos H. Papadimitriou:
  An Optimality Theory of Concurrency Control for Databases. Acta Informatica 19: 1-11 (1983)
• 
  Klaus Küspert:
  Storage Utilization in B*-Trees with a Generalized Overflow Technique. Acta Informatica 19: 35-55 (1983)
• 
  Hanne Riis Nielson:
  Computation Sequences: A Way to Characterize Classes of Attribute Grammars. Acta Informatica 19: 255-268 (1983)
• 
  Günther E. Pfaff:
  The Construction of Operator Interfaces Based on Logical Input Devices. Acta Informatica 19: 151-166 (1983)
• 
  Jean-Pierre Queille, Joseph Sifakis:
  Fairness and Related Properties in Transition Systems - A Temporal Logic to Deal with Fairness. Acta Informatica 19: 195-220 (1983)
• 
  Keijo Ruohonen:
  On Some Variants of Post's Correspondence Problem. Acta Informatica 19: 357-367 (1983)
• 
  Alfred Schmitt:
  On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables. Acta Informatica 19: 297-304 (1983)
• 
  Ute Schürfeld:
  New Lower Bounds on the Formula Size of Boolean Functions. Acta Informatica 19: 183-194 (1983)
• 
  Rudolph Sommerhalder, S. Christian van Westrhenen:
  Parallel Language Recognition in Constant Time by Cellular Automata. Acta Informatica 19: 397-407 (1983)
• 
  Ichiro Suzuki, Tadao Kasami:
  Three Measures for Synchronic Dependence in Petri Nets. Acta Informatica 19: 325-338 (1983)
• 
  Richard N. Taylor:
  Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Informatica 19: 57-84 (1983)
• 
  Takao Tsuda, Takashi Sato:
  Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. Acta Informatica 19: 13-33 (1983)
• 
  Takao Tsuda, Akira Urano, Takashi Sato:
  Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. Acta Informatica 19: 167-182 (1983)
• 
  Moshe Y. Vardi:
  Inferring Multivalued Dependencies From Functional and Join Dependencies. Acta Informatica 19: 305-324 (1983)