The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Mike Paterson, Shlomit Tassa, Uri Zwick
    Looking for MUM and DAD: Text-Text Comparisons Do Help. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:1-10 [Conf]
  2. Sanjay Jain
    Branch and Bound on the Network Model. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:11-21 [Conf]
  3. Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar
    A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:22-36 [Conf]
  4. Abhik Roychoudhury, Susmita Sur-Kolay
    Efficient Algorithms for Vertex Arboricity of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:37-51 [Conf]
  5. Ajit A. Diwan, N. Usharani
    A Condition for the Three Colourability of Planar Locally Path Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:52-61 [Conf]
  6. Peter Baumann, Karl Lermer
    A Framework for the Specification of Reactive and Concurrent Systems in Z. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:62-79 [Conf]
  7. Job Zwiers, Ulrich Hannemann, Yassine Lakhnech, Willem P. de Roever
    Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:80-95 [Conf]
  8. Jozef Hooman
    Verifying Part of the ACCESS.bus Protocol Using PVS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:96-110 [Conf]
  9. Luigi Petrone
    Reusing Batch Parsers as Incremental Parsers. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:111-123 [Conf]
  10. Prakash Panangaden
    The Expressive Power of Indeterminate Primitives in Asynchronous Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:124-150 [Conf]
  11. Jacques Garrigue
    The Transformation Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:151-165 [Conf]
  12. Jerzy Tiuryn
    Equational Axiomatization of Bicoercibility for Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:166-179 [Conf]
  13. Michel Raynal, André Schiper
    From Causal Consistency to Sequential Consistency in Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:180-194 [Conf]
  14. Alexander I. Tomlinson, Vijay K. Garg
    Observation of Software for Distributed Systems with RCL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:195-209 [Conf]
  15. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:210-224 [Conf]
  16. Deepak Kapur, G. Sivakumar
    Maximal Extensions os Simplification Orderings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:225-239 [Conf]
  17. Rainer Schuler
    Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:240-247 [Conf]
  18. Ravi Kumar, D. Sivakumar
    On Self-Testing without the Generator Bottleneck. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:248-262 [Conf]
  19. Mogens Nielsen, Allan Cheng
    Obseving Behaviour Categorically. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:263-278 [Conf]
  20. Paul Caspi, Jean-Claude Fernandez, Alain Girault
    An Algorithm for Reducing Binary Branchings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:279-293 [Conf]
  21. Michele Boreale, Luca Trevisan
    On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:294-308 [Conf]
  22. Ashvin Dsouza, Bard Bloom
    On the Expressive Power of CCS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:309-323 [Conf]
  23. Martin Odersky
    Polarized Name Passing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:324-337 [Conf]
  24. R. Balasubramanian, Venkatesh Raman
    Path Balance Heuristic for Self-Adjusting Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:338-348 [Conf]
  25. S. Rao Kosaraju
    Pattern Matching in Compressed Texts. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:349-362 [Conf]
  26. Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
    All-Pairs Min-Cut in Sparse Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:363-376 [Conf]
  27. Sandip K. Biswas, Sampath Kannan
    Minimizing Space Usage in Evaluation of Expression Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:377-390 [Conf]
  28. Herbert Edelsbrunner
    Smooth Surfaces for Multi-Scale Shape Representation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:391-412 [Conf]
  29. Christos Levcopoulos, Andrzej Lingas, Cao Wang
    On Parallel Complexity of Planar Triangulations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:413-427 [Conf]
  30. Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel
    Computing a Largest Empty Anchored Cylinder, and Related Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:428-442 [Conf]
  31. Drago Krznaric, Christos Levcopoulos
    Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:443-455 [Conf]
  32. Nils Klarlund, Madhavan Mukund, Milind A. Sohoni
    Determinizing Büchi Asnchronous Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:456-470 [Conf]
  33. Eugene Asarin, Oded Maler
    Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:471-483 [Conf]
  34. Anca Browne, Zohar Manna, Henny Sipma
    Generalized Temporal Verification Diagrams. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:484-498 [Conf]
  35. Andrea Bianco, Luca de Alfaro
    Model Checking of Probabalistic and Nondeterministic Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:499-513 [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