Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar11. FSTTCS 1991: New Delhi, India
Somenath Biswas, Kesav V. Nori:
Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings. Lecture Notes in Computer Science 560, Springer 1991, ISBN 3-540-54967-6
Invited Papers
Term Rewriting, Type Theory
Semantics, Chair: R. K. Shyamasundar
- John Case, Sanjay Jain, Arun Sharma:
Complexity Issues for Vacillatory Function Identification. 121-140
Automata Theory
- Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. 141-151 - Tao Jiang, Edward McDowell, Bala Ravikumar:
The Structure and Complexity of Minimal NFA's over a Unary Alphabet. 152-171
Structural Complexity
- Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. 212-223 - Iain A. Stewart:
Complete Problems Involving Boolean Labelled Structures and Projections Translations. 242-260
Agorithms I
Algorithms II
- Danny Krizanc, Lata Narayanan, Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays. 336-346
Algorithms III
- Yishay Mansour, James K. Park, Baruch Schieber:
Improved Selection on Totally Monotone Arrays. 347-359 - Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri:
Designing Secure Communication Protocols from Trust Specifications. 360-368 - Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Computing the Shortest Path Tree in a Weak Visibility Polygon. 369-389
Invited Paper
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-27 00:16 CEST by the dblp team