The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Paper info

Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien
Complexity of Some Problems in Petri Nets. [Citation Graph (2, 0)][DBLP]
Theor. Comput. Sci., 1977, v:4, n:3, pp:277-299 [Journal]

Scores and Rank
SCEAS: 0.61216
SCEAS_PS: 0.01179
SCEAS_BPS: 0.06371
SCEAS_EPS: 0.03365
SCEAS_BEPS: 0.18210
SCEAS_B0: 3.30169
PAGE_RANK: 0.56487
HITS_H: 0
HITS_A: 0.02212
BHITS_H: 0
BHITS_A: 0.00027
SALSA_A: 0.33113
SALSA_H: 0
BSALSA_A: 0.06212
BSALSA_H: 0
P: 0
BCC: 0.25172
citations_to_me: 2
citations_from_me: 0



Graph produced by graphviz-1.8.5
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:

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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002