The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1982, volume: 17, number:

  1. Meera Blattner, Seymour Ginsburg
    Position-Restricted Grammar Forms and Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:1-27 [Journal]
  2. Emo Welzl
    Color-Families are Dense. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:29-41 [Journal]
  3. Esko Ukkonen
    Structure Preserving Elimination of Null Productions from Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:43-54 [Journal]
  4. Eitan M. Gurari, Oscar H. Ibarra
    Some Simplified Undecidable and NP-Hard Problems for Simple Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:55-73 [Journal]
  5. Juris Hartmanis
    A Note on Natural Complete Sets and Gödel Numberings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:75-89 [Journal]
  6. Maciej M. Syslo
    The Subgraph Isomorphism Problem for Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:91-97 [Journal]
  7. Marek Karpinski
    Decidability of "Skolem Matrix Emptiness Problem" Entails Constructability of Exact Regular Expression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:99-102 [Journal]
  8. W. D. Fellner
    On Minimal Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:103-110 [Journal]
  9. Jean H. Gallier
    Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:111- [Journal]
  10. Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker
    Floyds Principle, Correctness Theories and Program Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:113-149 [Journal]
  11. Daniel J. Lehmann, Ana Pasztor
    Epis need not be Dense. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:151-161 [Journal]
  12. Bruno Courcelle, Paul Franchi-Zannettacci
    Attribute Grammars and Recursive Program Schemes I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:163-191 [Journal]
  13. Hajnal Andréka, István Németi, Ildikó Sain
    A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:193-212 [Journal]
  14. Ronald D. Dutton, Robert C. Brigham
    The Complexity of a Multiprocessor Task Assignment Problem without Deadlines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:213-216 [Journal]
  15. John C. Shepherdson
    Graph Theoretic Characterization of G-Schemes and TL-Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:217-228 [Journal]
  16. Craig C. Squier, Celia Wrathall
    A Note on Representations of a Certain Monoid. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:229-231 [Journal]
  17. Bruno Courcelle, Paul Franchi-Zannettacci
    Attribute Grammars and Recursive Program Schemes II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:235-257 [Journal]
  18. Hajnal Andréka, István Németi, Ildikó Sain
    A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:259-278 [Journal]
  19. Nachum Dershowitz
    Orderings for Term-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:279-301 [Journal]
  20. Jan A. Bergstra, J. V. Tucker
    Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:303-315 [Journal]
  21. Fereidoon Sadri, Jeffrey D. Ullman
    The Theory of Functional and Template Dependencies. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:317-331 [Journal]
  22. R. K. Shyamasundar
    On a Characterization of Pushdown Permuters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:333-341 [Journal]
  23. István Németi
    Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, 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