The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1985, volume: 38, number:

  1. Marie-Paule Flé, Gérard Roucairol
    Maximal Serializability of Iterated Transactions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:1-16 [Journal]
  2. Klaus Weihrauch
    Type 2 Recursion Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:17-33 [Journal]
  3. Christoph Kreitz, Klaus Weihrauch
    Theory of Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:35-53 [Journal]
  4. Ingo Wegener
    On the Complexity of Slice Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:55-68 [Journal]
  5. Marc Snir
    Lower Bounds on Probabilistic Linear Decision Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:69-82 [Journal]
  6. Prakash V. Ramanan, C. L. Liu
    Permutation Representation of k-Ary Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:83-98 [Journal]
  7. Catriel Beeri, Moshe Y. Vardi
    Formal Systems for Join Dependencies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:99-116 [Journal]
  8. Michel Leconte
    A Characterization of Power-Free Morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:117-122 [Journal]
  9. Do Long Van
    Ensembles Code-Compatibles et une Généralisation du Théorème de Sardinas-Patterson. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:123-132 [Journal]
  10. Ernst L. Leiss
    Succinct Representation of Regular Languages by Boolean Automata II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:133-136 [Journal]
  11. Alain Finkel
    Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:137-142 [Journal]
  12. Diana Schmidt
    The Recursion-Theoretic Structure of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:143-156 [Journal]
  13. Osamu Watanabe
    On One-One Polynomial Time Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:157-165 [Journal]
  14. Masatosi Imori, Hisao Yamada
    Periodic Character Sequences where Identifying two Characters Strictly Reduces the Period. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:167-192 [Journal]
  15. Hans-Dieter Burkhard
    An Investigation of Controls for Concurrent Systems Based on Abstract Control Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:193-222 [Journal]
  16. Matthias Jantzen
    Extending Regular Expressions with Iterated Shuffle. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:223-247 [Journal]
  17. Takao Asano
    An Approach to the Subgraph Homeomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:249-267 [Journal]
  18. Bhubaneswaru Mishra, Edmund M. Clarke
    Hierarchical Verification of Asynchronous Circuits Using Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:269-291 [Journal]
  19. Teofilo F. Gonzalez
    Clustering to Minimize the Maximum Intercluster Distance. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:293-306 [Journal]
  20. David Harel, David Peleg
    Process Logic with Regular Formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:307-322 [Journal]
  21. Daniel J. Rosenkrantz, Harry B. Hunt III
    Testing for Grammatical Coverings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:323-341 [Journal]
  22. Nathan Linial, Michael Tarsi
    Deciding Hypergraph 2-Colourability by H-Resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:343-347 [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