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

Paper info

Neil D. Jones, William T. Laaser
Complete Problems for Deterministic Polynomial Time. [Citation Graph (3, 0)][DBLP]
Theor. Comput. Sci., 1976, v:3, n:1, pp:105-117 [Journal]

Scores and Rank
SCEAS: 0.57099
SCEAS_PS: 0.14187
SCEAS_BPS: 0.09604
SCEAS_EPS: 0.21608
SCEAS_BEPS: 0.15015
SCEAS_B0: 3.26164
PAGE_RANK: 0.58910
HITS_H: 0
HITS_A: 0.43093
BHITS_H: 0
BHITS_A: 0.07123
SALSA_A: 0.49669
SALSA_H: 0
BSALSA_A: 0.25506
BSALSA_H: 0
P: 0.05118
BCC: 0.15913
citations_to_me: 3
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