The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Amir Pnueli
    System Specification and Refinement in Temporal Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:1-38 [Conf]
  2. Mads Dam
    Fixed Points of Büchi Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:39-50 [Conf]
  3. Y. S. Ramakrishna, Laura K. Dillon, Louise E. Moser, P. M. Melliar-Smith, G. Kutty
    An Automata-Theoretic Decision Procedure for Future Interval Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:51-67 [Conf]
  4. Philippe Granger
    Improving the Results of Static Analyses Programs by Local Decreasing Iteration. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:68-79 [Conf]
  5. Pankaj K. Agarwal, Marc J. van Kreveld
    Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:80-91 [Conf]
  6. Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
    An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:92-103 [Conf]
  7. Christos Levcopoulos, Andrzej Lingas
    C-sensitive Triangulations Approximate the MinMax Length Triangulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:104-115 [Conf]
  8. Harry Buhrman, Steven Homer
    Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:116-127 [Conf]
  9. Rainer Schuler, Tomoyuki Yamakami
    Structural Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:128-139 [Conf]
  10. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:140-151 [Conf]
  11. K. Ganesan
    One-way Functions and Isomorphism Conjecture. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:152-163 [Conf]
  12. Richa Agarwala, David Fernández-Baca
    Solving the Lagrangian Dual when the Number of Constraints is Fixed. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:164-175 [Conf]
  13. Laks V. S. Lakshmanan, Daniel A. Nonen
    Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:176-190 [Conf]
  14. Joachim Steinbach
    Proving Polynomials Positive. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:191-202 [Conf]
  15. Renganathan Sundararajan, John S. Conery
    An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:203-216 [Conf]
  16. Bruno Monsuez
    Polymorphic Typing by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:217-228 [Conf]
  17. Gérard P. Huet
    The Gallina Specification language: A Case Study. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:229-240 [Conf]
  18. Wolfgang Reif
    Verification of Large Software Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:241-252 [Conf]
  19. Vijay K. Garg, Brian Waldecker
    Detection of Unstable Predicates in Distributed Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:253-264 [Conf]
  20. Sachin B. Patkar, H. Narayanan
    Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cut. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:265-278 [Conf]
  21. R. Ravi, Balaji Raghavachari, Philip N. Klein
    Approximation Through Local Optimality: Designing Networks with Small Degree. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:279-290 [Conf]
  22. Samson Abramsky, Radha Jagadeesan
    Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:291-301 [Conf]
  23. Jens Chr. Godskesen, Kim Guldstrand Larsen
    Real-Time Calculi and Expansion Theorems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:302-315 [Conf]
  24. Didier Caucal
    Branching Bisimulation for Context-free Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:316-327 [Conf]
  25. Madhavan Mukund, Mogens Nielsen
    CCS, Location and Asynchronous Transition Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:328-341 [Conf]
  26. Linda Christoff, Ivan Christoff
    Reasonong about Safety and Liveness Properties for Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:342-355 [Conf]
  27. S. Muthukrishnan, H. Ramesh
    String Matching Under a General Matching Relation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:356-367 [Conf]
  28. Charles U. Martel, Ramesh Subramonian
    On the Complexity of Certified Write All Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:368-379 [Conf]
  29. J. Ian Munro, Venkatesh Raman
    Selection from Read-Only Memory and Sorting with Optimum Data Movement. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:380-391 [Conf]
  30. Bala Ravikumar
    Some Observations on 2-way Probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:392-403 [Conf]
  31. Kurt Mehlhorn
    Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:404- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002