7. FSTTCS 1987: Pune, India

Kesav V. Nori (Ed.): Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings. Lecture Notes in Computer Science 287 Springer 1987, ISBN 3-540-18625-5

Invited Talk

Yuri Gurevich:
Algenraic Operational Semantics. 1-2

Session 1: Automata and Formal Languages

K. G. Subramanian, Do Long Van, Rani Siromoney:
On Ambiguity of DTOL Systems. 3-14
Karel Culik II, Matti Linna:
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. 15-25
Oscar H. Ibarra, Bala Ravikumar:
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. 26-43
Michel Parigot:
Automata, Games, and Positive Monadic Theories of Trees. 44-57

Session 2: Graph Algorithms & Geometric Algorithms

Iain A. Stewart:
An Algorithm for Colouring Perfect Planar Graphs. 58-64
P. Shanti Sastry, N. Jayakumar, C. E. Veni Madhavan:
Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs. 65-78
Andrzej Lingas, Andrzej Proskurowski:
Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. 79-94
Christos Levcopoulos:
Improved Bounds for Covering General Polygons with Rectangles. 95-102

Session 3: Distributed Computinh

Joachim Parrow:
Submodule Construction as Equation Solving CCS. 103-123
Shaji Bhaskar, Gael N. Buckley:
Computations in Undistinguished Networks. 124-137
Rajive Bagrodia:
A Distributed Algorithm to Implement N-Party Rendevouz. 138-152
Jos C. M. Baeten, Rob J. van Glabbeek:
Merge and Termination in Process Algebra. 153-172

Invited Talk

K. Mani Chandy, Jayadev Misra:
Parallelism and Programming: A Perspective. 173-194

Session 4: Parallel Algorithms

Ethan Gannett, Suresh C. Kothari, Hsu-Chun Yen:
On Optimal Parallelization of Sorting Networks. 195-206
O. A. Ogunyode:
Parallel Algorithms for Approximate Edge Colouring of Simple graphs. 207-225
Sanguthevar Rajasekaran, Thanasis Tsantilas:
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. 226-241

Session 5: Database Theory

Pratul Dublish, S. N. Maheshwari:
An O(n²) Algorithm for Fan-Out Free Query Optimization. 242-264
R. C. Hansdah, Lalit M. Patnaik:
Weak Consistency Of Read-only Transactions: A Tool to Improve Concurrency in Heterogeneous Locking Protocols. 265-281
Sakti Pramanik, David Vineyard:
Optimizing Join Queries in Distributed Database. 282-304

Session 6: Logic Programming

Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur:
Reasoning in Systems of Equations and Inequations. 305-325
Lee Naish:
Specification = Program + Types. 326-339
Howard A. Blair, V. S. Subrahmanian:
Paraconsistent Logic Programming. 340-360
Ramaswamy Ramanujam:
Semantics of Distributed Horn Clause Programs. 361-371

Invited Talk

Gérard P. Huet:
The Calculus of Constructions: State of the Art. 372
David Gries:
Models for Re-Use. 373-375

Sesson 7: Programming Methodology

Dave Neilson:
Hierarchical Refinement Of A Z Specification. 376-399
Alain Laville:
Lazy pattern matching in the ML language. 400-419
Alberto Pettorossi:
Program Development Using Lambda Abstraction. 420-434

Session 8: Theory of Algorithms

Miklos Santha:
Relativized Arthur-Merlin versus Merlin-Arthur Games. 435-442
Stathis Zachos, Martin Furer:
Probabalistic Quantifiers vs. Distrustful Adversaries. 443-455
Vikraman Arvind, Somenath Biswas:
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. 456-469

Sesson 9: Software Technology

Ashok Kumar, Vishv M. Malhotra:
A Look-Ahead Interpreter for Sequential Prolog and Its Implementation. 470-484
Amitabha Sanyal, Supratim Biswas, Vishv M. Malhotra:
Extension of Weakest Precondition Formalism to a Low Level Language. 485-499
Kesav V. Nori, Sanjeev Kumar, M. Pavan Kumar:
Retrospection on the Compiler Structure. 500-527

Invited Talk

Rohit Parikh:
Some Recent Applications of Knowledge. 528-539

Last update Sat May 18 18:31:58 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page