|
Conferences in DBLP
- Yuri Gurevich
Algenraic Operational Semantics. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:1-2 [Conf]
- K. G. Subramanian, Do Long Van, Rani Siromoney
On Ambiguity of DTOL Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:3-14 [Conf]
- Karel Culik II, Matti Linna
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:15-25 [Conf]
- Oscar H. Ibarra, Bala Ravikumar
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:26-43 [Conf]
- Michel Parigot
Automata, Games, and Positive Monadic Theories of Trees. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:44-57 [Conf]
- Iain A. Stewart
An Algorithm for Colouring Perfect Planar Graphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:58-64 [Conf]
- P. Shanti Sastry, N. Jayakumar, C. E. Veni Madhavan
Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:65-78 [Conf]
- Andrzej Lingas, Andrzej Proskurowski
Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:79-94 [Conf]
- Christos Levcopoulos
Improved Bounds for Covering General Polygons with Rectangles. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:95-102 [Conf]
- Joachim Parrow
Submodule Construction as Equation Solving CCS. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:103-123 [Conf]
- Shaji Bhaskar, Gael N. Buckley
Computations in Undistinguished Networks. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:124-137 [Conf]
- Rajive Bagrodia
A Distributed Algorithm to Implement N-Party Rendevouz. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:138-152 [Conf]
- Jos C. M. Baeten, Rob J. van Glabbeek
Merge and Termination in Process Algebra. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:153-172 [Conf]
- K. Mani Chandy, Jayadev Misra
Parallelism and Programming: A Perspective. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:173-194 [Conf]
- Ethan Gannett, Suresh C. Kothari, Hsu-Chun Yen
On Optimal Parallelization of Sorting Networks. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:195-206 [Conf]
- O. A. Ogunyode
Parallel Algorithms for Approximate Edge Colouring of Simple graphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:207-225 [Conf]
- Sanguthevar Rajasekaran, Thanasis Tsantilas
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:226-241 [Conf]
- Pratul Dublish, S. N. Maheshwari
An O(n²) Algorithm for Fan-Out Free Query Optimization. [Citation Graph (2, 0)][DBLP] FSTTCS, 1987, pp:242-264 [Conf]
- R. C. Hansdah, Lalit M. Patnaik
Weak Consistency Of Read-only Transactions: A Tool to Improve Concurrency in Heterogeneous Locking Protocols. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:265-281 [Conf]
- Sakti Pramanik, David Vineyard
Optimizing Join Queries in Distributed Database. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:282-304 [Conf]
- Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur
Reasoning in Systems of Equations and Inequations. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:305-325 [Conf]
- Lee Naish
Specification = Program + Types. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:326-339 [Conf]
- Howard A. Blair, V. S. Subrahmanian
Paraconsistent Logic Programming. [Citation Graph (2, 0)][DBLP] FSTTCS, 1987, pp:340-360 [Conf]
- Ramaswamy Ramanujam
Semantics of Distributed Horn Clause Programs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:361-371 [Conf]
- Gérard P. Huet
The Calculus of Constructions: State of the Art. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:372- [Conf]
- David Gries
Models for Re-Use. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:373-375 [Conf]
- Dave Neilson
Hierarchical Refinement Of A Z Specification. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:376-399 [Conf]
- Alain Laville
Lazy pattern matching in the ML language. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:400-419 [Conf]
- Alberto Pettorossi
Program Development Using Lambda Abstraction. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:420-434 [Conf]
- Miklos Santha
Relativized Arthur-Merlin versus Merlin-Arthur Games. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:435-442 [Conf]
- Stathis Zachos, Martin Furer
Probabalistic Quantifiers vs. Distrustful Adversaries. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:443-455 [Conf]
- Vikraman Arvind, Somenath Biswas
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:456-469 [Conf]
- Ashok Kumar, Vishv M. Malhotra
A Look-Ahead Interpreter for Sequential Prolog and Its Implementation. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:470-484 [Conf]
- Amitabha Sanyal, S. Biswas, Vishv M. Malhotra
Extension of Weakest Precondition Formalism to a Low Level Language. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:485-499 [Conf]
- Kesav V. Nori, Sanjeev Kumar, M. Pavan Kumar
Retrospection on the Compiler Structure. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:500-527 [Conf]
- Rohit Parikh
Some Recent Applications of Knowledge. [Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:528-539 [Conf]
|