Journal list Promote Sponsor
verified SJR 0,426 · Q2 • database Scopus / SJR & Web of Science indexed
Mathematical Structures in Computer Science
United Kingdom · Cambridge University Press
workspace_premium Q2 — Mathematics (miscellaneous) lock_open Open Access

Mathematical Structures in Computer Science

Mathematical Structures in Computer Science is a journal indexed in SJR in Mathematics (miscellaneous) and Computer Science Applications with an H index of 48. It has a price of 1626,56 €. It has an SJR impact factor of 0,426 and it has a best quartile of Q2. It has an SJR impact factor of 0,426.

ISSN: 0960-1295
Publisher: Cambridge University Press
Category: Mathematics (miscellaneous)
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Visit publisher site menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
0,426 Q2
H-index 48
Acceptance rate pie_chart
32%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
1.627 € Open Access
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,426

H-index

48

Docs (year)

50

Docs 3y

122

Total refs

1602

Cites 3y

111

Citable 3y

110

Cites/Doc 2y

0.72

Ref/Doc

32.04

Immediate OA

1626,56 €

Embargoed OA

NPD

Non OA / Submission

0 €

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

Action semantics reasoning about functional programs

View more

When Scott is weak on the top

View more

Collections, sets and types

View more

Coinductive characterizations of applicative structures

View more

Category-based constraint logic

View more

Categorical properties of logical frameworks

View more

Categorical logic of names and abstraction in action calculi

View more

An enrichment theorem for an axiomatisation of

View more

An axiomatization of the category of Petri net computations

View more

An axiomatization of partial n-place operations

View more

Algorithms for categorical equivalence

View more

Algebraic properties of processes for Local Action

View more
SHOW MORE ARTICLES

Alambda-calculus with explicit weakening and explicit

View more

A categorical model for higher order imperative programming

View more

Abstract and behaviour module specifications

View more

A uniform approach to domain theory in realizability models

View more

A theory of classes: proofs and models

View more

A simple proof of the undecidability of strong normalisation

View more

A simple process algebra based on atomic actions with resources

View more

A semantics for lambda calculi with resources

View more

A semantic characterisation of the correctness of a proof net

View more

A general method for proving the normalization

View more

A filter model for mobile processes

View more

A computationally adequate model for overloading via domain-valued

View more

FAQs