The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Franco P. Preparata
    Planar Point Location Revisited (A Guided Tour of a Decade of Research). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:1-17 [Conf]
  2. Subir Kumar Gosh
    Computing a Viewpoint of a Set of Points Inside a Polygon. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:18-29 [Conf]
  3. Joseph Cheriyan, S. N. Maheshwari
    Analysis of Preflow Push Algorithms for Maximum Network Flow. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:30-48 [Conf]
  4. S. V. Krishnan, C. Pandu Rangan, S. Seshadri
    A New Linear Algorithm for the Two Path Problem on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:49-66 [Conf]
  5. Samir Khuller
    Extending Planar Graph Algorithms to K 3, 3-free Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:67-79 [Conf]
  6. Maxime Crochemore
    Constant-Space String-Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:80-87 [Conf]
  7. Susmita Sur-Kolay, Bhargab B. Bhattacharya
    Inherent Nonslicibility of Rectangular Duals in VLSI Floorplanning. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:88-107 [Conf]
  8. Amitava Datta, Kamala Krithivasan
    Path Planning with Local Information. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:108-121 [Conf]
  9. Ching-Tsun Chou
    Linear Broadcast Routing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:122- [Conf]
  10. Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
    Predicting deadlock in Store-and-Forward Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:123-142 [Conf]
  11. Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad
    On Parallel Sorting and Addition with Concurrent Writes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:143-153 [Conf]
  12. Christos Levcopoulos
    On Optimal Parallel Algorithm for Sorting Presorted Files. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:154-160 [Conf]
  13. V. Nageshwara Rao, Vipin Kumar
    Superlinear Speedup in Parallel State-Space Search. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:161-174 [Conf]
  14. H. Venkateswaran
    Circuit Definitions of Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:175-192 [Conf]
  15. Jürgen Kämper
    Non-Uniform Proof System: A New Framework to Describe Non-Uniform and Probabalistic Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:193-210 [Conf]
  16. Sanjeev N. Khadilkar
    Padding, Commitment and Self-reducability. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:211-224 [Conf]
  17. Craig A. Rich
    The Complexity of a Counting Finite-State Automaton. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:225-239 [Conf]
  18. Walter W. Kirchherr
    A Hierarchy Theorem for Pram-Based Complexity Classes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:240-249 [Conf]
  19. Rod M. Burstall, Furio Honsell
    A Natural Deduction treatment of Operational Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:250-269 [Conf]
  20. Patrick Bellot
    Unformly Applicative Structures, A Theory of Computability and Polyadic Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:270-285 [Conf]
  21. Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
    A Proof Technique for Register Automicity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:286-303 [Conf]
  22. Jules Desharnais, Nazim H. Madhavji
    Relation Level Semantics. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:304-328 [Conf]
  23. Martin C. Henson, Raymond Turner
    A Constructive Set Theory for Program Development. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:329-347 [Conf]
  24. Prakash Panangaden
    McCarthy's Amb Cannot Implement Fair Merge. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:348-363 [Conf]
  25. Koichi Furukawa, Kazunori Ueda
    GHC - A Language for a New Age of Parallel Programming. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:364-376 [Conf]
  26. Keshav Pingali, Kattamuri Ekanadham
    Accumulators: A New Logic Variable Abstractions for Functional Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:377-399 [Conf]
  27. K. S. H. S. R. Bhatta, Harish Karnick
    A Resolution Rule for Well-Formed Formulae. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:400-418 [Conf]
  28. Stéphane Kaplan
    Algebraic and Operational Semantics of Positive/Negative Conditional Algebraic Specification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:419-434 [Conf]
  29. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
    Semi-Unification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:435-454 [Conf]
  30. Alain Beauvieux
    A Method to Check Knowledge Base Consistency. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:455-468 [Conf]
  31. José Luiz Fiadeiro, Amílcar Sernadas, Cristina Sernadas
    Knowledgebases as Structured Theories. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:469-486 [Conf]
  32. Jürgen M. Janas
    On Functional Independencies. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 1988, pp:487-508 [Conf]
  33. Bharat K. Bhargava, Shirley Browne
    A Generic Algorithm for Transaction Processing During Network Partitioning. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:509-519 [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