Conferences in DBLP
Robert A. Kowalski Logic for Knowledge Representation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:1-12 [Conf ] T. S. E. Maibaum , M. R. Sadler , Paulo A. S. Veloso Logical Specification and Implementation. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:13-30 [Conf ] Ramaswamy Ramanujam , R. K. Shyamasundar Process Specification of Logic Programs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:31-43 [Conf ] Asis K. Goswami , Lalit M. Patnaik Functional Programming Sytem Revisited. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:44-59 [Conf ] Thomas J. Myers , A. Toni Cohen Models and Transformations for Nondeterministic Extensions of Functional Programming. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:60-88 [Conf ] Mogens Nielsen , P. S. Thiagarajan Degrees of Non-Determinism and Concurrency: A Petri Net View. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:89-117 [Conf ] Gadi Taubenfeld , Nissim Francez Proof Rules for Communication Abstractions (Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:118- [Conf ] N. Natarajan A Distributed Algorithm for Detecting Communication Deadlocks. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:119-135 [Conf ] Saumya K. Debray , Ariel J. Frank , Scott A. Smolka On the Existence and Construction of Robust Communication Protocals for Unreliable Channels. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:136-151 [Conf ] Bhargab B. Bhattacharya , Suranjan Ghose , Bhabani P. Sinha , Pradip K. Srimani Heuristic Search Approach to Optimal Routing in a Distributed Architecture. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:152-164 [Conf ] Meurig Beynon Replacement in Monotone Boolean Networks: An Algebraic Perspective. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:165-178 [Conf ] Stathis Zachos A New Characterization of BPP. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:179-187 [Conf ] Kamala Krithivasan Treating Terminals as Function Values of Time. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:188-201 [Conf ] Rohit Parikh Logics of Knowledge, Games and Dynamic Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:202-222 [Conf ] Malcolm P. Atkinson , Ronald Morrison Persistent First Class Procedures are Enough. [Citation Graph (1, 0)][DBLP ] FSTTCS, 1984, pp:223-240 [Conf ] Rudi Studer Abstraction Concepts for Modeling Screen Oriented Dialogue Interfaces. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:241-258 [Conf ] Rajiv Kane , Sartaj Sahni VLSI Systems For Design Rule Checks. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:259-278 [Conf ] Christos Levcopoulos , Andrzej Lingas Bounds on the Length of Convex Partitions of Polygons. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:279-295 [Conf ] I. V. Ramakrishnan On Mapping Cube Graphs onto VLSI Arrays. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:296-316 [Conf ] Subir Kumar Gosh A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:317-330 [Conf ] Gael N. Buckley , Abraham Silberschatz Eliminating Cascading Rollback in Structured Database. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:331-343 [Conf ] V. S. Lakshmanan , N. Chandrasekaran , C. E. Veni Madhavan Recognition and Top-Down Generation of beta-Acyclic Database Schemes. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:344-366 [Conf ] Sushil Jajodia Universal and Representative Instances Using Unmarked Nulls. [Citation Graph (1, 0)][DBLP ] FSTTCS, 1984, pp:367-378 [Conf ] F. de Santis , Maria I. Sessa On Some Computational Problems Related to Data Base Coding (Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:379- [Conf ] Bruno Poizat Generic Oracles (Abstract). [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:380- [Conf ] C. E. Veni Madhavan Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:381-392 [Conf ] Mireille Régnier Grid File Algorithms: An Analysis in the Biased Case. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:393-418 [Conf ] Asim K. Pal , A. Bagchi On the Mean Weight Balance Factor of Binary Trees. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:419-434 [Conf ] P. Gupta , G. P. Bhattacharjee An Efficient Algorithm for Random Sampling without Replacement. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1984, pp:435-465 [Conf ]