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

• 1987
• 
  Vikraman Arvind, Somenath Biswas:
  On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. FSTTCS 1987: 456-469
• 
  Jos C. M. Baeten, Rob J. van Glabbeek:
  Merge and Termination in Process Algebra. FSTTCS 1987: 153-172
• 
  Rajive L. Bagrodia:
  A Distributed Algorithm to Implement N-Party Rendevouz. FSTTCS 1987: 138-152
• 
  Shaji Bhaskar, Gael N. Buckley:
  Computations in Undistinguished Networks. FSTTCS 1987: 124-137
• 
  Howard A. Blair, V. S. Subrahmanian:
  Paraconsistent Logic Programming. FSTTCS 1987: 340-360
• 
  K. Mani Chandy, Jayadev Misra:
  Parallelism and Programming: A Perspective. FSTTCS 1987: 173-194
• 
  Karel Culík II, Matti Linna:
  The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. FSTTCS 1987: 15-25
• 
  Pratul Dublish, S. N. Maheshwari:
  An O(n²) Algorithm for Fan-Out Free Query Optimization. FSTTCS 1987: 242-264
• 
  Ethan Gannett, Suresh C. Kothari, Hsu-Chun Yen:
  On Optimal Parallelization of Sorting Networks. FSTTCS 1987: 195-206
• 
  David Gries:
  Models for Re-Use. FSTTCS 1987: 373-375
• 
  Yuri Gurevich:
  Algenraic Operational Semantics. FSTTCS 1987: 1-2
• 
  R. C. Hansdah, Lalit M. Patnaik:
  Weak Consistency Of Read-only Transactions: A Tool to Improve Concurrency in Heterogeneous Locking Protocols. FSTTCS 1987: 265-281
• 
  Gérard P. Huet:
  The Calculus of Constructions: State of the Art. FSTTCS 1987: 372
• 
  Oscar H. Ibarra, Bala Ravikumar:
  Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. FSTTCS 1987: 26-43
• 
  Ashok Kumar, Vishv M. Malhotra:
  A Look-Ahead Interpreter for Sequential Prolog and Its Implementation. FSTTCS 1987: 470-484
• 
  Alain Laville:
  Lazy pattern matching in the ML language. FSTTCS 1987: 400-419
• 
  Christos Levcopoulos:
  Improved Bounds for Covering General Polygons with Rectangles. FSTTCS 1987: 95-102
• 
  Andrzej Lingas, Andrzej Proskurowski:
  Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. FSTTCS 1987: 79-94
• 
  Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur:
  Reasoning in Systems of Equations and Inequations. FSTTCS 1987: 305-325
• 
  Lee Naish:
  Specification = Program + Types. FSTTCS 1987: 326-339
• 
  Dave Neilson:
  Hierarchical Refinement Of A Z Specification. FSTTCS 1987: 376-399
• 
  Kesav V. Nori, Sanjeev Kumar, M. Pavan Kumar:
  Retrospection on the Compiler Structure. FSTTCS 1987: 500-527
• 
  O. A. Ogunyode:
  Parallel Algorithms for Approximate Edge Colouring of Simple graphs. FSTTCS 1987: 207-225
• 
  Michel Parigot:
  Automata, Games, and Positive Monadic Theories of Trees. FSTTCS 1987: 44-57
• 
  Rohit Parikh:
  Some Recent Applications of Knowledge. FSTTCS 1987: 528-539
• 
  Joachim Parrow:
  Submodule Construction as Equation Solving CCS. FSTTCS 1987: 103-123
• 
  Alberto Pettorossi:
  Program Development Using Lambda Abstraction. FSTTCS 1987: 420-434
• 
  Sakti Pramanik, David Vineyard:
  Optimizing Join Queries in Distributed Database. FSTTCS 1987: 282-304
• 
  Sanguthevar Rajasekaran, Thanasis Tsantilas:
  An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. FSTTCS 1987: 226-241
• 
  Ramaswamy Ramanujam:
  Semantics of Distributed Horn Clause Programs. FSTTCS 1987: 361-371

skipping 7 more matches