• 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

• 1997
• 
  Vikraman Arvind, Johannes Köbler:
  On Resource-Bounded Measure and Pseudorandomness. FSTTCS 1997: 235-249
• 
  Frank S. de Boer, Ulrich Hannemann, Willem P. de Roever:
  Hoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency. FSTTCS 1997: 267-283
• 
  K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh:
  Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997: 37-53
• 
  Edmund M. Clarke:
  Model Cheking. FSTTCS 1997: 54-56
• 
  Raymond R. Devillers, Hanna Klaudel, Robert-C. Riemann:
  General Refinement for High Level Petri Nets. FSTTCS 1997: 297-311
• 
  Tamal K. Dey, Arunabha Roy, Nimish R. Shah:
  Approximating Geometric Domains through Topological Triangulations. FSTTCS 1997: 6-21
• 
  Catherine Dufourd, Alain Finkel:
  Polynomial-Time Manz-One Reductions for Petri Nets. FSTTCS 1997: 312-326
• 
  Andrew D. Gordon, Paul D. Hankin, Søren B. Lassen:
  Compilation and Equivalence of Imperative Objects. FSTTCS 1997: 74-87
• 
  Burkhard Graves:
  Computing Reachability Properties Hidden in Finite Net Unfoldings. FSTTCS 1997: 327-341
• 
  Deepak Kapur, Mahadevan Subramaniam:
  Mechanizing Verification of Arithmetic Circuits: SRT Division. FSTTCS 1997: 103-122
• 
  A. J. Kfoury:
  Recursion Versus Iteration at Higher-Orders. FSTTCS 1997: 57-73
• 
  Sandeep S. Kulkarni, Anish Arora:
  Compositional Design of Multitolerant Repetitive Byzantine Agreement. FSTTCS 1997: 169-183
• 
  Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam:
  Solving Some Discrepancy Problems in NC. FSTTCS 1997: 22-36
• 
  Massimo Marchiori:
  On the Expressive Power of Rewriting. FSTTCS 1997: 88-102
• 
  Swarup Mohalik, Ramaswamy Ramanujam:
  Assumption-Commitment in Automata. FSTTCS 1997: 153-168
• 
  Kedar S. Namjoshi:
  A Simple Characterization of Stuttering Bisimulation. FSTTCS 1997: 284-296
• 
  Enrico Pontelli, Desh Ranjan, Gopal Gupta:
  On the Complexity of Parallel Implementation of Logic Programs. FSTTCS 1997: 123-137
• 
  Vijaya Ramachandran:
  QSM: A General Purpose Shared-Memory Model for Parallel Computation. FSTTCS 1997: 1-5
• 
  Anil Seth:
  Sharper Results on the Expressive Power of Generalized Quantifiers. FSTTCS 1997: 200-219
• 
  Madhu Sudan:
  Algorithmic Issues in Coding Theory. FSTTCS 1997: 184-199
• 
  Moshe Y. Vardi:
  Verification of Open Systems. FSTTCS 1997: 250-266
• 
  N. V. Vinodchandran:
  Improved Lowness Results for Solvable Black-box Group Problems. FSTTCS 1997: 220-234
• 
  Jia-Huai You, Li-Yan Yuan, Randy Goebel:
  An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure. FSTTCS 1997: 138-152
• 
  S. Ramesh, G. Sivakumar:
  Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings. Lecture Notes in Computer Science 1346, Springer 1997, ISBN 3-540-63876-8 [contents]