4. FSTTCS 1984: Bangalore, India
Mathai Joseph, R. K. Shyamasundar (Eds.): Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings. Springer 1984 Lecture Notes in Computer Science ISBN 3-540-13883-8
Keynote Address
- Robert A. Kowalski: Logic for Knowledge Representation. 1-12
Session 1: Specification and Programming
- Thomas J. Myers, A. Toni Cohen: Models and Transformations for Nondeterministic Extensions of Functional Programming. 60-88
Invited Talk
- Mogens Nielsen, P. S. Thiagarajan: Degrees of Non-Determinism and Concurrency: A Petri Net View. 89-117
Session 2: Distributed Systems
- N. Natarajan: A Distributed Algorithm for Detecting Communication Deadlocks. 119-135
- Saumya K. Debray, Ariel J. Frank, Scott A. Smolka: On the Existence and Construction of Robust Communication Protocals for Unreliable Channels. 136-151
- Bhargab B. Bhattacharya, Suranjan Ghose, Bhabani P. Sinha, Pradip K. Srimani: Heuristic Search Approach to Optimal Routing in a Distributed Architecture. 152-164
Session 3: Theory
- Meurig Beynon: Replacement in Monotone Boolean Networks: An Algebraic Perspective. 165-178
- Stathis Zachos: A New Characterization of BPP. 179-187
- Kamala Krithivasan: Treating Terminals as Function Values of Time. 188-201
Invited Talk
- Rohit Parikh: Logics of Knowledge, Games and Dynamic Logic. 202-222
Session 4: Program Construction
- Rudi Studer: Abstraction Concepts for Modeling Screen Oriented Dialogue Interfaces. 241-258
Invited Talk
Session 5: VLSI
- Christos Levcopoulos, Andrzej Lingas: Bounds on the Length of Convex Partitions of Polygons. 279-295
- I. V. Ramakrishnan: On Mapping Cube Graphs onto VLSI Arrays. 296-316
- Subir Kumar Ghosh: A Linear-Time Algorithm for Determining the Intersection Type of Two Star Polygons. 317-330
Session 6: Data Bases
- Gael N. Buckley, Abraham Silberschatz: Eliminating Cascading Rollback in Structured Database. 331-343
- V. S. Lakshmanan, N. Chandrasekharan, C. E. Veni Madhavan: Recognition and Top-Down Generation of beta-Acyclic Database Schemes. 344-366
- Sushil Jajodia: Universal and Representative Instances Using Unmarked Nulls. 367-378
- F. de Santis, Maria I. Sessa: On Some Computational Problems Related to Data Base Coding (Abstract). 379
Session 7: Algorithms and Complexity
- Bruno Poizat: Generic Oracles (Abstract). 380
- C. E. Veni Madhavan: Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. 381-392
- Mireille Régnier: Grid File Algorithms: An Analysis in the Biased Case. 393-418
- P. Gupta, G. P. Bhattacharjee: An Efficient Algorithm for Random Sampling without Replacement. 435-465
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team