The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Dines Bjørner
    Software Development Graphs. A Unifying Concept for Software Development? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:1-9 [Conf]
  2. David S. Rosenblum, Sriram Sankar, David C. Luckham
    Concurrent Runtime Checking of Annotated Ada Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:10-35 [Conf]
  3. Amitabh Srivastava
    Recovery of Noncurrent Variables in Source-Level Debugging of Optimized Code. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:36-56 [Conf]
  4. Vishv M. Malhotra, Sanjeev Kumar
    Automatic Retargetable Code Generation: A New Technique. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:57-80 [Conf]
  5. S. Sridhar
    An Implementation of OBJ2: An Object-Oriented Language for Abstract Program Specification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:81-95 [Conf]
  6. Jean-Louis Lassez, Kim Marriott
    Explicit Representation of Terms Defined by Counter Examples. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:96-107 [Conf]
  7. Vipin Kumar, Yow-Jian Lin
    A Framework for Intelligent Backtracking in Logic Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:108-123 [Conf]
  8. Yellamraju V. Srinivas, Rajeev Sangal
    A Generalization of Backus' FP. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:124-143 [Conf]
  9. Christos H. Papadimitriou
    Shortest-Path Motion. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:144-153 [Conf]
  10. Jayaram Bhaskar, Sartaj Sahni
    Via Assignment in Single Row Routing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:154-176 [Conf]
  11. Prakash V. Ramanan, Kazuhiro Tsuga
    Average-Case Analysis of the Modified Marmonic Algorithm. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:177-192 [Conf]
  12. Ravi Kannan, László Lovász
    Covering Minima and Lattice Point Free Convex Bodies. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:193-213 [Conf]
  13. V. S. Lakshmanan, C. E. Veni Madhavan
    Binary Decompositions and Acyclic Schemes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:214-238 [Conf]
  14. Danièle Beauquier
    Thin Homogeneous Sets of Factors. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:239-251 [Conf]
  15. Joachim von zur Gathen
    Irreducible Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:252-262 [Conf]
  16. Ravi Kannan
    Basis Reduction and Evidence for Transcendence of Certain Numbers. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:263-269 [Conf]
  17. S. R. Goregaokar, S. Arun-Kumar
    A Characterization of Asynchronous Message-Passing. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:270-287 [Conf]
  18. Ajoy Kumar Datta, Sukumar Ghosh
    Modular Synthesis of Deadlock-Free Control Structures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:288-318 [Conf]
  19. Inder S. Gopal, Parviz Kermani
    Distributed Resource Sharing in Computer Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:319-329 [Conf]
  20. Rob Gerth, Liuba Shrira
    On Proving Communication Closedness of Distributed Layers. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:330-343 [Conf]
  21. H. Mohanty, G. P. Bhattacharjee
    A Distributed Algorithm for Edge-Disjoint Path Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:344-361 [Conf]
  22. Abha Moitra
    Scheduling of Hard Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:362-381 [Conf]
  23. Dorit S. Hochbaum, David B. Shmoys
    A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:382-393 [Conf]
  24. László Lovász
    Connectivity Algorithms Using Rubber-bands. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:394-411 [Conf]
  25. Steven Homer
    On Simple and Creative Sets in NP. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:412-425 [Conf]
  26. Deepak Kapur, Paliath Narendran, Hantao Zhang
    Complexity of Sufficient-Completeness. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:426-442 [Conf]
  27. Umesh V. Vazirani, Vijay V. Vazirani
    Sampling a Population with a Semi-Random Source. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:443-452 [Conf]
  28. Alan Gibbons, Wojciech Rytter
    An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:453-469 [Conf]
  29. Victor Y. Pan, John H. Reif
    Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:470-487 [Conf]
  30. Sanjay V. Rajopadhye, S. Purushothaman, Richard Fujimoto
    On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:488-503 [Conf]
  31. Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan
    An Efficient Parallel Algorithm for Term Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:504-518 [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