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

• 1976
• 
  Harry G. Barrow, Rod M. Burstall:
  Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. Inf. Process. Lett. 4(4): 83-84 (1976)
• 
  Jon Louis Bentley, Walter A. Burkhard:
  Heuristics for Partial-Match Retrieval Data Base Design. Inf. Process. Lett. 4(5): 132-135 (1976)
• 
  Stanislaw Chrobot:
  Layer - A Language Construction for Concurrent Structure Program Design. Inf. Process. Lett. 4(5): 113-117 (1976)
• 
  Wolfgang Coy:
  The Logical Meaning of Programs of a Subrecursive Language. Inf. Process. Lett. 4(5): 121-126 (1976)
• 
  Jim Cunningham, M. E. J. Gilford:
  A Note on the Semantic Definition of Side Effects. Inf. Process. Lett. 4(5): 118-120 (1976)
• 
  David P. Dobkin, Jan van Leeuwen:
  The Complexity of Vector-Products. Inf. Process. Lett. 4(6): 149-154 (1976)
• 
  Hans-Dieter Ehrich, Witold Lipski Jr.:
  On the Storage Space Requirement of Consecutive Retrieval with Redundancy. Inf. Process. Lett. 4(4): 101-104 (1976)
• 
  Joost Engelfriet, Sven Skyum:
  Copying Theorems. Inf. Process. Lett. 4(6): 157-161 (1976)
• 
  Stefan Feyock:
  Noiselike Transforms of omega-Events. Inf. Process. Lett. 4(4): 105-108 (1976)
• 
  Zvi Galil:
  Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms. Inf. Process. Lett. 4(4): 85-87 (1976)
• 
  David R. Hanson:
  A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments. Inf. Process. Lett. 4(4): 109-112 (1976)
• 
  M. S. Krishnamurthy, H. R. Ramesha Chandra:
  A Note on Precedence Functions. Inf. Process. Lett. 4(4): 99-100 (1976)
• 
  Roman Krzemien, Andrzej Lukasiewicz:
  Automatic Generation of Lexical Analyzers in a Compiler-Compiler. Inf. Process. Lett. 4(6): 165-168 (1976)
• 
  Leslie Lamport:
  Comments on "A Synchronization Anomaly". Inf. Process. Lett. 4(4): 88-89 (1976)
• 
  Tomás Lang, Eduardo B. Fernández:
  Scheduling of Unit-Length Independent Tasks with Execution Constraints. Inf. Process. Lett. 4(4): 95-98 (1976)
• 
  Paul Pritchard:
  A Proof Rule for Multiple Coroutine Systems. Inf. Process. Lett. 4(6): 141-143 (1976)
• 
  Peter J. A. Reusch:
  Generalized Lattices Applicable in Retrieval Models. Inf. Process. Lett. 4(6): 144-148 (1976)
• 
  Grzegorz Rozenberg:
  On Slicing of K-Iteration Grammars. Inf. Process. Lett. 4(5): 127-131 (1976)
• 
  Grzegorz Rozenberg, Derick Wood:
  A Note on K-Iteration Grammars. Inf. Process. Lett. 4(6): 162-164 (1976)
• 
  Russell L. Wessner:
  Optimal Alphabetic Search Trees With Restricted Maximal Height. Inf. Process. Lett. 4(4): 90-94 (1976)
• 
  S. De Wolf, G. De Mey:
  Numerical Solution of Integral Equations for Potential Problems by a Variational Principle. Inf. Process. Lett. 4(5): 136-139 (1976)
• 
  Gideon Yuval:
  An Algorithm for Finding All Shortest Paths Using N(2.81) Infinite-Precision Multiplications. Inf. Process. Lett. 4(6): 155-156 (1976)
• 1975
• 
  Robert S. Anderssen, Anthony J. Guttmann:
  A Rationale for the Numerical Differentiation of Experimental Data. Inf. Process. Lett. 4(2): 48-50 (1975)
• 
  J. Banerjee, V. Rajaraman:
  A Dual Link Data Structure for Random File Organization. Inf. Process. Lett. 4(3): 64-69 (1975)
• 
  Ronald A. Christensen:
  Crossvalidation: Minimizing the Entropy of the Future. Inf. Process. Lett. 4(3): 73-76 (1975)
• 
  Douglas W. Clark:
  A Fast Algorithm for Copying Binary Trees. Inf. Process. Lett. 4(3): 62-63 (1975)
• 
  Ernest J. Cockayne, Seymour E. Goodman, Stephen T. Hedetniemi:
  A Linear Algorithm for the Domination Number of a Tree. Inf. Process. Lett. 4(2): 41-44 (1975)
• 
  Arthur G. Duncan, Lawrence Yelowitz:
  Loop Unravelling: A Practical Tool in Proving Program Correctness. Inf. Process. Lett. 4(3): 70-72 (1975)
• 
  Giorgio Germano, Andrea Maggiolo-Schettini:
  Sequence-to-Sequence Recursiveness. Inf. Process. Lett. 4(1): 1-6 (1975)
• 
  Laurent Hyafil, Jean-Paul Van de Wiele:
  On the Additive Complexity of Specific Polynomials. Inf. Process. Lett. 4(2): 45-47 (1975)

skipping 14 more matches