Journal of Computer and System Sciences

Aims & Scope

The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory.

Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions.

Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.

View Aims & Scope

---

Metrics & Ranking

Journal Rank

Year	Value
2024	4574

Journal Citation Indicator

Year	Value
2024	291

SJR (SCImago Journal Rank)

Year	Value
2024	1.033

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	106

Impact Factor

Year	Value
2024	1.10

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting

  Citation: 12474

  Authors: Yoav, Robert E

• Probabilistic encryption

  Citation: 2273

  Authors: Shafi, Silvio

• Variable precision rough set model

  Citation: 1677

  Authors: Wojciech

• Computing with Membranes

  Citation: 1635

  Authors: Gheorghe

• Universal classes of hash functions

  Citation: 1503

  Authors: J.Lawrence, Mark N.

• Approximation algorithms for combinatorial problems

  Citation: 1446

  Authors: David S.

• A theory of type polymorphism in programming

  Citation: 1324

  Authors: Robin

• Optimization, approximation, and complexity classes

  Citation: 1115

  Authors: Christos H., Mihalis

• NP-complete scheduling problems

  Citation: 1053

  Authors: J.D.

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

  Citation: 1039

  Authors: Kellogg S., George S.

---