The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Eljas Soisalon-Soininen
    On the Covering Problem for Left-Recursive Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:1-11 [Journal]
  2. Mitchell Wand
    Fixed-Point Constructions in Order-Enriched Categories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:13-30 [Journal]
  3. Wolfgang Bibel
    Tautology Testing with a Generalized Matrix Reduction Method. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:31-44 [Journal]
  4. Franco P. Preparata, David E. Muller
    Finding the Intersection of n Half-Spaces in Time O(n log n). [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:45-55 [Journal]
  5. Peter Johansen
    The Generating Function of the Number of Subpatterns of a D0L Sequence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:57-68 [Journal]
  6. Kosaburo Hashiguchi
    A Decision Procedure for the Order of Regular Events. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:69-72 [Journal]
  7. Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens
    Recursive Assertions are not enough - or are they? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:73-87 [Journal]
  8. Mila E. Majster-Cederbaum
    Data Types, Abstract Data Types and Their Specification Problem. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:89-127 [Journal]
  9. John E. Hopcroft, Jean-Jacques Pansiot
    On the Reachability Problem for 5-Dimensional Vector Addition Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:135-159 [Journal]
  10. Theodore P. Baker, Alan L. Selman
    A Second Step Toward the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:177-187 [Journal]
  11. Leslie G. Valiant
    The Complexity of Computing the Permanent. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:189-201 [Journal]
  12. Pavel Pudlák, Frederick N. Springsteel
    Complexity in Mechanized Hypothesis Formation. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:203-225 [Journal]
  13. Petr Hájek
    Arithmetical Hierarchy and Complexity of Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:227-237 [Journal]
  14. Juris Hartmanis
    Relations Between Diagonalization, Proof Systems, and Complexity Gaps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:239-253 [Journal]
  15. Jacques Morgenstern
    Une Extension du Theoreme de Winograd. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:255-259 [Journal]
  16. André Arnold, Michel Latteux
    A New Proof of two Theorems about Rational Transductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:261-263 [Journal]
  17. Corrado Böhm, Mariangiola Dezani-Ciancaglini, P. Peretti, Simona Ronchi Della Rocca
    A Discrimination Algorithm Inside lambda-beta-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:265-292 [Journal]
  18. Joffroy Beauquier
    Generateurs Algebriques et Systemes de Paires Iterantes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:293-323 [Journal]
  19. Calvin C. Elgot, John C. Shepherdson
    A Semantically Meaningful Characterization of Reducible Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:325-357 [Journal]
  20. Shmuel Winograd
    On Multiplication in Algebraic Extension Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:359-377 [Journal]
  21. Danny Dolev
    Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:379-391 [Journal]
  22. J. Roger Hindley
    The Discrimination Theorem Holds for Combinatory Weak Reduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:393-394 [Journal]
  23. Jean-Michel Autebert
    Une Note sur le Cylindre des Langages Déterministes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:395-399 [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