Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
1991 (conf/fsttcs/1991)

1. Manuel Blum
   Program Checking. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:1-9 [Conf]
   
2. Andreas Blass, Yuri Gurevich
   Randomizing Reductions of Search Problems. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:10-24 [Conf]
   
3. David Sands
   Time Analysis, Cost Equivalence and Program Refinement. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:25-39 [Conf]
   
4. Subrata Mitra, G. Sivakumar
   AC-Equation Solving. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:40-56 [Conf]
   
5. Qing-Ping Tan, Huo-Wang Chen
   On the Operational Interpretation of Complex Types. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:57-70 [Conf]
   
6. Kamal Lodaya, Ramaswamy Ramanujam
   Tense Logics for Local Reasoning in Distributed Systems. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:71-88 [Conf]
   
7. Luca Aceto, Uffe Engberg
   Failures Semantics for a Simple Process Language with Refinement. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:89-108 [Conf]
   
8. Hardi Hungar
   Correstness of Programs over Poor Signatures. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:109-120 [Conf]
   
9. John Case, Sanjay Jain, Arun Sharma
   Complexity Issues for Vacillatory Function Identification. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 1991, pp:121-140 [Conf]
   
10. Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
    A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:141-151 [Conf]
    
11. Tao Jiang, Edward McDowell, Bala Ravikumar
    The Structure and Complexity of Minimal NFA's over a Unary Alphabet. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:152-171 [Conf]
    
12. Meena Mahajan, Kamala Krithivasan
    Relativised Cellular Automata and Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:172-185 [Conf]
    
13. Sam M. Kim, Robert McNaughton
    Computing the Order of a Locally Testable Automaton. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:186-211 [Conf]
    
14. Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
    On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:212-223 [Conf]
    
15. Manindra Agrawal
    NP-hard Sets and Creativeness over Constant Time Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:224-241 [Conf]
    
16. Iain A. Stewart
    Complete Problems Involving Boolean Labelled Structures and Projections Translations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:242-260 [Conf]
    
17. V. Vinay
    Is BP.+P a Probabilistic Class? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:261-265 [Conf]
    
18. J. Ian Munro, Venkatesh Raman
    Fast Sorting In-Place Sorting with O(n) Data. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:266-277 [Conf]
    
19. Vangelis Th. Paschos
    A Theorem on the Approximation of Set Cover and Vertex Cover. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:278-287 [Conf]
    
20. Sachin B. Patkar, H. Narayanan
    A Fast Algorithm for the Principle Partition of a Graph. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:288-306 [Conf]
    
21. Inga Niepel, Peter Rossmanith
    Uniform Circuits and Exclusive Read PRAMs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:307-318 [Conf]
    
22. Martin Fürer
    Contracting Planar Graphs Efficiency in Parallel. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:319-335 [Conf]
    
23. Danny Krizanc, Lata Narayanan, Rajeev Raman
    Fast Deterministic Selection on Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:336-346 [Conf]
    
24. Yishay Mansour, James K. Park, Baruch Schieber
    Improved Selection on Totally Monotone Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:347-359 [Conf]
    
25. Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri
    Designing Secure Communication Protocols from Trust Specifications. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:360-368 [Conf]
    
26. Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Computing the Shortest Path Tree in a Weak Visibility Polygon. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:369-389 [Conf]
    
27. Binay K. Bhattacharya
    Usefulness of Angle-Sweep over Line-Sweep. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:390-419 [Conf]
    
28. Glynn Winskel
    Petri Nets and Transition Systems (Abstract for an invited talk). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:420- [Conf]