The SCEAS System
Navigation Menu

Paper info

Ron van der Meyden
The Complexity of Querying Indefinite Data about Linearly Ordered Domains. [Citation Graph (2, 0)][DBLP]
J. Comput. Syst. Sci., 1997, v:54, n:1, pp:113-135 [Journal]

Scores and Rank
SCEAS: 0.54702
SCEAS_PS: 0.02103
SCEAS_BPS: 0.04845
SCEAS_EPS: 0.05321
SCEAS_BEPS: 0.12259
SCEAS_B0: 3.23833
PAGE_RANK: 0.54286
HITS_H: 0
HITS_A: 0.05871
BHITS_H: 0
BHITS_A: 0.00484
SALSA_A: 0.33113
SALSA_H: 0
BSALSA_A: 0.10609
BSALSA_H: 0
P: 0.00000
BCC: 0.15749
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002