The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1991, volume: 81, number: 2

  1. Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman
    Semi-Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:169-187 [Journal]
  2. Sanjeev N. Khadilkar, Somenath Biswas
    Padding, Commitment and Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:189-199 [Journal]
  3. Keshav Pingali, Kattamuri Ekanadham
    Accumulators: New Logic Variable Abstractions for Functional Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:201-221 [Journal]
  4. K. S. H. S. R. Bhatta, Harish Karnick
    A Resolution Rule for Well-Formed Formulae. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:223-235 [Journal]
  5. Hans L. Bodlaender
    New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:237-256 [Journal]
  6. Katja Lenz, Ingo Wegener
    The Conjunctive Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:257-268 [Journal]
  7. Peter R. J. Asveld
    Abstract Grammars Based on Transductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:269-288 [Journal]
  8. Jürgen Dassow
    On the Connectedness of Pictures in Chain Code Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:289-294 [Journal]
  9. To-Yat Cheung, Yun-zhou Zhu
    Recognizing Different Types of Beta-Cycles in a Database Scheme. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:295-304 [Journal]
  10. Erzsébet Csuhaj-Varjú, Jozef Kelemen
    On the Power of Cooperation: A Regular Representation of Recursively Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:305-310 [Journal]
  11. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
    On the Parallel Recognition of Unambiguous Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:311-316 [Journal]
  12. Nimrod Megiddo, Christos H. Papadimitriou
    On Total Functions, Existence Theorems and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:317-324 [Journal]
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