9. FSTTCS 1989: Bangalore, India
Graph Algorithms, Chair:
G. P. Bhattacharjee
Logic Programming, Chair:
V. S. Subrahmanian
: Algebraic Properties of The Space of Multivalued and Paraconsistent Logic Programs.
Y. J. Jiang
: An Autoepistemic Logical View of Knowledge Base.
Michael J. Maher
: A Transformation System for Deductive Database Modules with Perfect Model Semantics.
Distributed Computing, Chair:
L. M. Patnaik
, Yahui Zhu
: An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks.
C. R. Muthukrishnan
, Elena Zucca
: An Algebraic Compositional Semantics of an Object Oriented Notation with Concurrency.
Software Technology, Chair:
H. V. Sahasrabuddhe
Complexity and Analysis of Algorithms, Chair:
V. S. Lakshmanan
: Query Evaluation with Null Values: How Complex is Completeness?
: Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in Database.
Geometric Algorithms, Chair:
C. E. Veni Madhavan
: A Proof System for Communicating Processes with Value-passing (Extended Abstract).