10. FSTTCS 1990: Bangalore, India

@proceedings{DBLP:conf/fsttcs/1990,
  editor    = {Kesav V. Nori and
               C. E. Veni Madhavan},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings},
  booktitle = {FSTTCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {472},
  year      = {1990},
  isbn      = {3-540-53487-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Paper

• Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez: Reasoning About Linear Constraints Using Parametric Queries. 1-20 BibTeX

Logic

• Li-Yan Yuan, Jia-Huai You: Discriminant Circumscription. 21-32 BibTeX
• Ramesh Subrahmanyam: Complexity of Algebraic Specification. 33-37 BibTeX
• Ralf Treinen: A New Method for Undecidability Proofs of First Order Theories. 48-62 BibTeX
• M. Masseron, Christophe Tollu, Jacqueline Vauzeilles: Generating Plans in Linear Logic. 63-75 BibTeX

Automata and Formal Languages

• Karel Culik II, Simant Dube: Automata-Theoretic Techniques for Image Generation and Compression. 76-90 BibTeX
• Abdellatif Saoudi: Recognizable Infinite Tree Sets and their Complexity. 91-103 BibTeX
• V. Vinay, V. Chandru: The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata. 104-114 BibTeX

Theory of Programming

• Christopher P. Lewington: Towards Constructive Program Derivation in VDM. 115-132 BibTeX
• Deepak Kapur, G. Sivakumar, Hantao Zhang: A New Method for Proving Termination of AC-Rewrite Systems. 133-148 BibTeX

Parallel Algorithms

• John H. Reif, Akhilesh Tyagi: Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. 149-160 BibTeX
• Rajeev Raman: The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. 161-175 BibTeX
• Rong Lin, Stephan Olariu: Fast Parallel Algorithms for Cographs. 176-189 BibTeX
• John Case, Dayanand S. Rajan, Anil M. Shende: Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena. 190-203 BibTeX
• Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter: Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. 204-214 BibTeX
• Sanguthevar Rajasekaran: Randomized Parallel Selection. 215-224 BibTeX
• David Pearson, Vijay V. Vazirani: A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. 225-231 BibTeX

Invited Paper

• S. Rao Kosaraju: On Parallel Evaluation of Classes of Circuits. 232-237 BibTeX

Geometrical Algorithms

• Jyh-Jong Fu, Richard C. T. Lee: Voronoi Diagrams of Moving Points in the Plane. 238-254 BibTeX
• Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray: Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. 255-269 BibTeX
• Amitava Datta, G. D. S. Ramkumar: On Some Largest Empty Orthoconvex Polygons in a Point Set. 270-285 BibTeX

Concurrency

• Marta Z. Kwiatkowska: Defining Process Fairness for Non-Interleaving Concurrency. 286-300 BibTeX
• Rocco De Nicola, Gian Luigi Ferrari: Observational Logics and Concurrency Models. 301-315 BibTeX

Distributed Computing

• Anish Arora, Mohamed G. Gouda: Distributed Reset (Extended Abstract). 316-331 BibTeX
• Peter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen: Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary Variables. 332-348 BibTeX
• Tong-Ying Tony Juang, Subbarayan Venkatesan: Efficient Algorithms for Crash Recovery in Distributed Systems. 349-361 BibTeX

Semantics

• Gianna Reggio: A Non-Standard Inductive Semantics. 362-372 BibTeX
• Kurt Sieber: Relating Full Abstraction Results for Different Programming Languages. 373-387 BibTeX

Invited Lectures in Honour of Prof. R. Narasimhan, TIFR, Bombay

• B. Chandrasekaran, N. Hari Narayanan: Towards a Theory of Commonsense Visual Reasoning. 388-409 BibTeX
• Akshar Bharati, Rajeev Sangal, Vineet Chaitanya: Natural Language Processing, Complexity Theory and Logic (Extended Abstract). 410-420 BibTeX