The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
    Reasoning About Linear Constraints Using Parametric Queries. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 1990, pp:1-20 [Conf]
  2. Li-Yan Yuan, Jia-Huai You
    Discriminant Circumscription. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:21-32 [Conf]
  3. Ramesh Subrahmanyam
    Complexity of Algebraic Specification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:33-37 [Conf]
  4. Ralf Treinen
    A New Method for Undecidability Proofs of First Order Theories. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:48-62 [Conf]
  5. M. Masseron, Christophe Tollu, Jacqueline Vauzeilles
    Generating Plans in Linear Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:63-75 [Conf]
  6. Karel Culik II, Simant Dube
    Automata-Theoretic Techniques for Image Generation and Compression. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:76-90 [Conf]
  7. Abdellatif Saoudi
    Recognizable Infinite Tree Sets and their Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:91-103 [Conf]
  8. V. Vinay, V. Chandru
    The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:104-114 [Conf]
  9. Christopher P. Lewington
    Towards Constructive Program Derivation in VDM. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:115-132 [Conf]
  10. Deepak Kapur, G. Sivakumar, Hantao Zhang
    A New Method for Proving Termination of AC-Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:133-148 [Conf]
  11. John H. Reif, Akhilesh Tyagi
    Efficient Parallel Algorithms for Optical Computing with the DFT Primitive. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:149-160 [Conf]
  12. Rajeev Raman
    The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:161-175 [Conf]
  13. Rong Lin, Stephan Olariu
    Fast Parallel Algorithms for Cographs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:176-189 [Conf]
  14. John Case, Dayanand S. Rajan, Anil M. Shende
    Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:190-203 [Conf]
  15. Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
    Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:204-214 [Conf]
  16. Sanguthevar Rajasekaran
    Randomized Parallel Selection. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:215-224 [Conf]
  17. David Pearson, Vijay V. Vazirani
    A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:225-231 [Conf]
  18. S. Rao Kosaraju
    On Parallel Evaluation of Classes of Circuits. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:232-237 [Conf]
  19. Jyh-Jong Fu, Richard C. T. Lee
    Voronoi Diagrams of Moving Points in the Plane. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:238-254 [Conf]
  20. Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray
    Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:255-269 [Conf]
  21. Amitava Datta, G. D. S. Ramkumar
    On Some Largest Empty Orthoconvex Polygons in a Point Set. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:270-285 [Conf]
  22. Marta Z. Kwiatkowska
    Defining Process Fairness for Non-Interleaving Concurrency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:286-300 [Conf]
  23. Rocco De Nicola, Gian Luigi Ferrari
    Observational Logics and Concurrency Models. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:301-315 [Conf]
  24. Anish Arora, Mohamed G. Gouda
    Distributed Reset (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:316-331 [Conf]
  25. Peter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen
    Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary Variables. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:332-348 [Conf]
  26. Tony T.-Y. Juang, Subbarayan Venkatesan
    Efficient Algorithms for Crash Recovery in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:349-361 [Conf]
  27. Gianna Reggio
    A Non-Standard Inductive Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:362-372 [Conf]
  28. Kurt Sieber
    Relating Full Abstraction Results for Different Programming Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:373-387 [Conf]
  29. B. Chandrasekaran, N. Hari Narayanan
    Towards a Theory of Commonsense Visual Reasoning. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:388-409 [Conf]
  30. Akshar Bharati, Rajeev Sangal, Vineet Chaitanya
    Natural Language Processing, Complexity Theory and Logic (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:410-420 [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