The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1988, volume: 56, number:

  1. Dieter Armbruster
    A Polynomial Determination of the Most-Recent Property in Pascal-Like Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:3-15 [Journal]
  2. Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones
    A Safe Approach to Parallel Combinator Reduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:17-36 [Journal]
  3. Stéphane Kaplan
    Rewriting with a Nondeterministic Choice Operator. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:37-57 [Journal]
  4. Flemming Nielson, Hanne Riis Nielson
    Two-Level Semantics and Code Generation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:59-133 [Journal]
  5. Eugene W. Stark
    Proving Entailment Between Conceptual State Specifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:135-154 [Journal]
  6. Emanuela Fachini, Margherita Napoli
    C-Tree Systolic Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:155-186 [Journal]
  7. V. Wiktor Marek
    A Natural Semantics for Modal Logic Over Databases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:187-209 [Journal]
  8. Costas S. Iliopoulos
    On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:211-222 [Journal]
  9. Shoji Sekimoto, Sachio Hirokawa
    One-Step Recurrent Terms in lambda-beta-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:223-231 [Journal]
  10. Arturo Carpi
    Multidimensional Unrepetitive Configurations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:233-241 [Journal]
  11. Jeanleah Mohrherr
    A Remark on the Length Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:243-248 [Journal]
  12. Carol Tretkoff
    Complexity, Combinatorial Group Theory and the Language of Palutators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:253-275 [Journal]
  13. John Staples
    Delaying Unification Algorithms for Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:277-288 [Journal]
  14. Erich Grädel
    Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:289-301 [Journal]
  15. André Martino
    A Quantitative Interpretation of Girard's System F. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:303-320 [Journal]
  16. R. Boonyavatana, Giora Slutzki
    The Interchange or Pump (Di)Lemmas for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:321-338 [Journal]
  17. Véronique Bruyère
    An Answer to a Question about Finite Maximal Prefix Sets of Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:339-344 [Journal]
  18. Franz Baader, Wolfram Büttner
    Unification in Commutative Idempotent Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:345-353 [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