Promote Sponsor
verified SJR 1,803 · Q1 database Scopus / SJR & Web of Science indexed
Information Sciences
United States · Elsevier Inc.
workspace_premium Q1 — Software lock Subscription Unclaimed

Information Sciences

Information Sciences is a journal indexed in SJR in Software and Computer Science Applications with an H index of 243. It has an SJR impact factor of 1,803 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,803.

Information Sciences focuses its scope in these topics and keywords: autonomous, algorithm, topic, fuzzy, based, evolutionary, message, structural, recommendation, multiobjective, ...

ISSN: 0020-0255
Editorial: Elsevier Inc.
Category: Software
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
1,803 Q1
H-index 243
Tasa de Aceptación pie_chart
20% Selectiva
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
NPD Subscription
Ruta Non-OA NPD

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

1,803

H-index

243

Docs (year)

1306

Docs 3y

3981

Total refs

57494

Cites 3y

33358

Citable 3y

3973

Cites/Doc 2y

8.25

Ref/Doc

44.02

Immediate OA

Embargoed OA

NPD

Non OA / Submission

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

A proportional feedback scheme for ATM networks

View more

Virtual lines, a deadlock-free and real-time routing mechanism for ATM networks

View more

Approximating integrably bounded fuzzy random variables in terms of the "generalized" Hausdorff metric

View more

Approximate reasoning and evidence theory

View more

Analytical Theory of Fuzzy Control with Applications

View more

An improved algorithm for concurrency control in distributed database systems

View more

An extension of classical functional dependency: dynamic fuzzy functional dependency

View more

An extended database design methodology for uncertain data management

View more

An evolutionary approach for time optimal trajectory planning of a robotic manipulator

View more

An application of the (p, q)-logic to the synthesis of the p-valued logical networks and the s - (p, q)-logical completeness

View more

A wide-spectrum language for object-based development of real-time systems

View more

A technique for qualitatively synthesizing the structure of risk management vehicles

View more
SHOW MORE ARTICLES

A reader for the cognitive map

View more

A criterion to enforce correctness of indirectly cooperating applications

View more

A probabilistic approach to navigation in Hypertext

View more

A performance evaluation study of four wavelet algorithms for the pitch period estimation of speech signals

View more

A novel fuzzy logic approach to microcalcification detection

View more

A note on two-dimensional probabilistic Turing machines

View more

A note on two-dimensional probabilistic finite automata

View more

A near real-time Evolution-based Adaptation Strategy for dynamic Color Quantization of image sequences

View more

A mathematical analysis on 2PL and tree protocol

View more

A lower bound on the encoding length in lossy transmission

View more

A fuzzy variable structure approach to feedback regulation of uncertain dynamical systems, with application to robotics

View more

A formal method for inheritance graph hierarchy construction

View more

FAQS