The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1994, volume: 135, number: 1

  1. Samson Abramsky
    Proofs as Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:5-9 [Journal]
  2. Gianluigi Bellin, Philip J. Scott
    On the pi-Calculus and Linear Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:11-65 [Journal]
  3. Didier Galmiche, Guy Perrier
    On Proof Normalization in Linear Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:67-110 [Journal]
  4. Gianfranco Mascari, Marco Pedicini
    Head Linear Reduction and Pure Proof Net Extraction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:111-137 [Journal]
  5. Patrick Lincoln, Andre Scedrov
    First-Order Linear Logic without Modalities is NEXPTIME-Hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:139-153 [Journal]
  6. Patrick Lincoln, Timothy C. Winkler
    Constant-Only Multiplicative Linear Logic is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:1, pp:155-169 [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