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

• 1983
• 
  Joffroy Beauquier:
  Prefix and Perfect Languages. CAAP 1983: 129-140
• 
  Eike Best, M. W. Shields:
  Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. CAAP 1983: 141-154
• 
  Maurizio A. Bonuccelli, Elena Lodi, Fabrizio Luccio, Piero Maestrini, Linda Pagli:
  VLSI Mesh of Trees for Data Base Processing. CAAP 1983: 155-166
• 
  Manfred Broy, Martin Wirsing:
  Generalized Heterogeneous Algebras and Partial Interpretations. CAAP 1983: 1-34
• 
  M. F. Claerebout, Eric Lilin:
  Continuite des transducteurs d'états finis d'arbes. CAAP 1983: 167-178
• 
  Mario Coppo, Mariangiola Dezani-Ciancaglini, Giuseppe Longo:
  Applicative Information Systems. CAAP 1983: 35-64
• 
  Mario Coppo, Elio Giovannetti:
  Completeness Results for a Polymorphic Type System. CAAP 1983: 179-190
• 
  Bruno Courcelle, F. Lavandier:
  A Class of Program Schemes Based on Tree Rewriting Systems. CAAP 1983: 191-204
• 
  François Fages, Gérard P. Huet:
  Complete Sets of Unifiers and Matchers in Equational Theories. CAAP 1983: 205-220
• 
  Ronald Fagin:
  Acyclic Database Schemes (of Various Degrees): A Painless Introduction. CAAP 1983: 65-89
• 
  Philippe Flajolet, Nasser Saheb:
  Digital Search Trees and the Generation of an Exponentially Distributed Variate. CAAP 1983: 221-235
• 
  Zvi Galil:
  Efficient Algorithms for Finding Maximal Matching in Graphs. CAAP 1983: 90-113
• 
  Jacob Gonczaroski:
  Decidable Properties of Monadic Recursive Schemas with a Depth Parameter. CAAP 1983: 236-254
• 
  Sorin Istrail, Cristian Masalagiu:
  Nivat-Processing Systems: Decision Problems Related to Protection and Synchronization. CAAP 1983: 255-268
• 
  Dirk Janssens, Grzegorz Rozenberg:
  A Survey of NLC Grammars. CAAP 1983: 114-128
• 
  Jean-Pierre Jouannaud:
  Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types. CAAP 1983: 269-283
• 
  Andrzej Lingas:
  An Application of Maximum Bipartite C-Matching to Subtree Isomorphism. CAAP 1983: 284-299
• 
  Bernd Mahr, Johann A. Makowsky:
  Characterizing Specification Languages Which Admit Initial Semantics. CAAP 1983: 300-316
• 
  Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough:
  Topological Bandwidth. CAAP 1983: 317-331
• 
  Alberto Marchetti-Spaccamela, Maurizio Talamo:
  Probabilistic Analysis of Graph Colouring Algorithms. CAAP 1983: 332-340
• 
  Burkhard Monien, Ewald Speckenmeyer:
  Some Further Approximation Algorithms for the Vertex Cover Problem. CAAP 1983: 341-349
• 
  Jan Paredaens, Dirk Van Gucht:
  An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database Schemes. CAAP 1983: 350-366
• 
  Wojciech Rytter:
  Remarks on the Pyramidal Structure. CAAP 1983: 367-376
• 
  Donald Sannella, Rod M. Burstall:
  Structured Theories in LCF. CAAP 1983: 377-391
• 
  Giora Slutzki:
  Alternating Tree Automata. CAAP 1983: 392-404
• 
  Marisa Venturini Zilli:
  Cofinality in Reduction Graphs. CAAP 1983: 405-416
• 
  Giorgio Ausiello, Marco Protasi:
  CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings. Lecture Notes in Computer Science 159, Springer 1983, ISBN 3-540-12727-5 [contents]