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 BibTeX

@proceedings{DBLP:conf/fsttcs/1987,
  editor    = {Kesav V. Nori},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               Seventh Conference, Pune, India, December 17-19, 1987, Proceedings},
  booktitle = {FSTTCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {287},
  year      = {1987},
  isbn      = {3-540-18625-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk

Yuri Gurevich: Algenraic Operational Semantics. 1-2 BibTeX

Session 1: Automata and Formal Languages

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

Session 2: Graph Algorithms & Geometric Algorithms

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

Session 3: Distributed Computinh

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

Invited Talk

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

Session 4: Parallel Algorithms

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

Session 5: Database Theory

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

Session 6: Logic Programming

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

Invited Talk

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

Sesson 7: Programming Methodology

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

Session 8: Theory of Algorithms

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

Sesson 9: Software Technology

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

Invited Talk

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