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

• 1986
• 
  Emile H. L. Aarts, F. M. J. de Bont, J. H. A. Habers, Peter J. M. van Laarhoven:
  A Parallel Statistical Cooling Algorithm. STACS 1986: 87-97
• 
  M. A. Nait Abdallah:
  Icons and Local Definitions in Logic Programming. STACS 1986: 60-72
• 
  José L. Balcázar, Ronald V. Book:
  On Generalized Kolmogorov Complexity. STACS 1986: 334-340
• 
  Gilles Bernot, Michel Bidoit, Christine Choppy:
  Abstract Implementations and Correctness Proofs. STACS 1986: 236-251
• 
  Hans L. Bodlaender, Jan van Leeuwen:
  New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS 1986: 119-129
• 
  Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
  A Time-Space Tradeoff for Element Distinctness. STACS 1986: 353-358
• 
  Didier Caucal:
  Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. STACS 1986: 37-48
• 
  Christian Choffrut, Marcel Paul Schützenberger:
  Décomposition de Fonctions Rationnelles. STACS 1986: 213-226
• 
  Philippe Darondeau:
  Separating and Testing. STACS 1986: 203-212
• 
  Christine Duboc:
  Equations in Free Partially Commutative Monoids. STACS 1986: 192-202
• 
  E. Allen Emerson, Chin-Laung Lei:
  Temporal Reasoning Under Generalized Fairness Constraints. STACS 1986: 21-36
• 
  David de Frutos-Escrig:
  Some Probabilistic Powerdomains in the Category SFP. STACS 1986: 49-59
• 
  B. Gamatie:
  Towards Specification and Proof of Asynchronous Systems. STACS 1986: 262-276
• 
  Juris Hartmanis, Lane A. Hemachandra:
  On Sparse Oracles Separating Feasible Complexity Classes. STACS 1986: 321-333
• 
  Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr:
  Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS 1986: 105-118
• 
  Friedhelm Meyer auf der Heide:
  Speeding up Random Access Machines by Few Processors. STACS 1986: 142-152
• 
  Harry B. Hunt III, Richard Edwin Stearns:
  Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). STACS 1986: 277-290
• 
  Oscar H. Ibarra, Bala Ravikumar:
  On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. STACS 1986: 171-179
• 
  Udo Kelter:
  Strictness and Serializability. STACS 1986: 252-261
• 
  Chandra M. R. Kintala, Detlef Wotschke:
  Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). STACS 1986: 291-305
• 
  Thomas Lengauer:
  Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. STACS 1986: 153-170
• 
  Andrzej Lingas:
  Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. STACS 1986: 98-103
• 
  Kurt Mehlhorn, Franco P. Preparata:
  Area-time Optimal Division for T=Omega(log n)^1+epsilon. STACS 1986: 341-352
• 
  Flemming Nielson:
  Abstract Interpretation of Denotational Definions (A Survey). STACS 1986: 1-20
• 
  Jean-Pierre Pécuchet:
  Variétés de Semis Groupes et Mots Infinis. STACS 1986: 180-191
• 
  Rüdiger Reischuk:
  Parallel Machines and their Communication Theoretical Limits. STACS 1986: 359-368
• 
  Louis E. Rosier, Hsu-Chun Yen:
  Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. STACS 1986: 306-320
• 
  Ursula Schmidt:
  Long Unavoidable Patterns. STACS 1986: 227-235
• 
  Paul G. Spirakis:
  Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. STACS 1986: 73-86
• 
  Roberto Tamassia, Ioannis G. Tollis:
  Algorithms for Visibility Representations of Planar Graphs. STACS 1986: 130-141

skipping 1 more match