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

• 1989
• 
  Mohan Ahuja, Yahui Zhu:
  An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks. FSTTCS 1989: 99-108
• 
  Luc Albert:
  Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in Database. FSTTCS 1989: 223-241
• 
  Chandrajit L. Bajaj, Tamal K. Dey:
  Robust Decompositions of Polyhedra. FSTTCS 1989: 267-279
• 
  Flavio Bonomi, Peter J. Fleming, P. Steinberg:
  An Adaptive Regulator Approach for the Design of Load Sharing Algorithms. FSTTCS 1989: 121-130
• 
  Ruth Breu, Elena Zucca:
  An Algebraic Compositional Semantics of an Object Oriented Notation with Concurrency. FSTTCS 1989: 131-142
• 
  Sajal K. Das, Narsingh Deo, Sushil K. Prasad:
  Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis. FSTTCS 1989: 280-290
• 
  Phan Minh Dung, Kanchana Kanchanasut:
  A Natural Semantics for Logic Programs with Negation. FSTTCS 1989: 78-88
• 
  Hartmut Ehrig, Werner Fey, Horst Hansen, Michael Löwe, Dean Jacobs:
  Algebraic Software Development Concepts for Module and Configuration Families. FSTTCS 1989: 181-192
• 
  Giorgio Gambosi, Marco Protasi, Maurizio Talamo:
  An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests. FSTTCS 1989: 252-266
• 
  Jeremy Gunawardena:
  Deducing Causal Relationships in CCS. FSTTCS 1989: 161-170
• 
  Lane A. Hemachandra, Sanjay Jain:
  On the Limitations of Locally Robust Positive Reductions. FSTTCS 1989: 193-203
• 
  Matthew Hennessy:
  A Proof System for Communicating Processes with Value-passing (Extended Abstract). FSTTCS 1989: 325-339
• 
  Oscar H. Ibarra, Tao Jiang, Hui Wang:
  Parallel Parsing on a One-way Linear Array of Finite-State Machines. FSTTCS 1989: 291-300
• 
  Beverly Jamison, Stephan Olariu:
  A Linear-Time Recognition Algorithm for P₄-Reducible Graphs. FSTTCS 1989: 1-19
• 
  Yuejun Jiang:
  An Autoepistemic Logical View of Knowledge Base. FSTTCS 1989: 68-77
• 
  Mathai Joseph:
  Time and Real-time in Programs. FSTTCS 1989: 312-324
• 
  Ravi Kannan:
  The Frobenius Problem. FSTTCS 1989: 242-251
• 
  Victor N. Kasyanov:
  Annotated Program Transformations. FSTTCS 1989: 171-180
• 
  P. Sreenivasa Kumar, C. E. Veni Madhavan:
  A New Class of Separators and Planarity of Chordal Graphs. FSTTCS 1989: 30-43
• 
  V. S. Lakshmanan:
  Query Evaluation with Null Values: How Complex is Completeness? FSTTCS 1989: 204-222
• 
  Michael J. Maher:
  A Transformation System for Deductive Database Modules with Perfect Model Semantics. FSTTCS 1989: 89-98
• 
  Madhavan Mukund, P. S. Thiagarajan:
  An Axiomatization of Event Structures. FSTTCS 1989: 143-160
• 
  Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
  Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization. FSTTCS 1989: 20-29
• 
  A. Srinivasa Rao, C. Pandu Rangan:
  Optimal Parallel Algorithms on Circular-Arc Graphs. FSTTCS 1989: 44-55
• 
  V. S. Subrahmanian:
  Algebraic Properties of The Space of Multivalued and Paraconsistent Logic Programs. FSTTCS 1989: 56-67
• 
  Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
  Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). FSTTCS 1989: 109-120
• 
  Akhilesh Tyagi:
  Energy-Time Trade-offs in VLSI Computation. FSTTCS 1989: 301-311
• 
  C. E. Veni Madhavan:
  Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings. Lecture Notes in Computer Science 405, Springer 1989, ISBN 3-540-52048-1 [contents]