The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1979, volume: 9, number:

  1. David A. Plaisted
    Fast Verification, Testing, and Generation of Large Primes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:1-16 [Journal]
  2. Jean-Pierre Duval
    Periodes et Repetitions des Mots du Monoide Libre. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:17-26 [Journal]
  3. Jan A. Bergstra, Jan Willem Klop
    Church-Rosser Strategies in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:27-38 [Journal]
  4. Irène Guessarian
    Program Transformations and Algebraic Semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:39-65 [Journal]
  5. Richard Statman
    Intuitionistic Propositional Logic is Polynomial-Space Complete. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:67-72 [Journal]
  6. Richard Statman
    The Typed lambda-Calculus is not Elementary Recursive. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:73-81 [Journal]
  7. Ingo Wegener
    Switching Functions Whose Monotone Complexity is Nearly Quadratic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:83-97 [Journal]
  8. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
    The Number of Registers Required for Evaluating Arithmetic Expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:99-125 [Journal]
  9. Gerd Wechsung, Andreas Brandstädt
    A Relation Between Space, Return and Dual Return Complexities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:127-140 [Journal]
  10. Gilles Christol
    Ensembles Presque Periodiques k-Reconnaissables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:141-145 [Journal]
  11. Ingo Wegener
    A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:147-150 [Journal]
  12. A. Tang
    Chain Properties in P omega. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:153-172 [Journal]
  13. Michael A. Harrison, Ivan M. Havel, Amiram Yehudai
    On Equivalence of Grammars Through Transformation Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:173-205 [Journal]
  14. Juhani Karhumäki
    On Commutative DT0L Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:207-220 [Journal]
  15. Dominique Perrin
    La Representation Ergodique d'un Automate fini. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:221-241 [Journal]
  16. Edward A. Ashcroft, Faith E. Fich
    A Generalized Setting for Fixpoint Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:243-256 [Journal]
  17. Stephen L. Bloom, Ralph Tindell
    Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:265-286 [Journal]
  18. Anton Nijholt
    Simple Chain Grammars and Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:287-309 [Journal]
  19. Katsushi Inoue, Itsuo Takanami, Akira Nakamura, Tadashi Ae
    One-Way Simple Multihead Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:311-328 [Journal]
  20. Raymond Aubin
    Mechanizing Structural Induction Part I: Formal System. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:329-345 [Journal]
  21. Raymond Aubin
    Mechanizing Structural Induction Part II: Strategies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:347-362 [Journal]
  22. Christophe Reutenauer
    Sur les Series Associees a Certains Systemes de Lindenmayer. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:363-375 [Journal]
  23. Keijo Ruohonen
    On Some Decidability Problems for HD0L Systems with Nonsingular Parikh Matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:377-384 [Journal]
  24. F. Rodriguez
    Familles de Langages Fermees par Crochet Ouvert. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:385-398 [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