ISSN: 0960-1295

Journal Guideline

Mathematical Structures in Computer Science Q2 Unclaimed

Cambridge University Press United Kingdom

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

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

Type: Journal

Type of Copyright:

Languages:

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Mathematics (miscellaneous) (Q2) Computer Science Applications (Q3)

Price

1626,56 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

Mathematical Structures in Computer Science

0,486

SJR Impact factor

46

H Index

32

Total Docs (Last Year)

133

Total Docs (3 years)

1210

Total Refs

94

Total Cites (3 years)

122

Citable Docs (3 years)

0.59

Cites/Doc (2 years)

37.81

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Comptes Rendus Mathematique Q2
Journal of Approximation Theory Q2
Siberian Mathematical Journal Q2
Acta Mathematica Scientia Q2
Studia Mathematica Q2

Compare this journals

Aims and Scope

Best articles by citations

Varieties generated by languages with poset operations

Higher dimensional automata revisited

Homotopy invariants of higher dimensional categories and concurrency in computer science

Extending partial combinatory algebras

Fromlambda to p; or, Rediscovering continuations

Unique decomposition categories, Geometry of Interaction and combinatory logic

Category-based constraint logic

On the number of fixed points of a combinator in lambda calculus

A simple process algebra based on atomic actions with resources

Minimal realization in bicategories of automata

Unique factorisation lifting functors and

Relating operational and denotational semantics for

SHOW MORE ARTICLES

On permuting cut with contraction

Domain equations for probabilistic processes

Intersection types and bounded polymorphism

A simple proof of the undecidability of strong normalisation

Syntactic composition of top-down tree transducers is short cut fusion

Obsessional experiments for linear logic proof-nets

Hidden coinduction:

A categorical model for higher order imperative programming

Introduction

A categorical version of the BrouwerHeytingKolmogorov interpretation

Perpetuality in a named lambda calculus with

Structured transition systems with parametric observations: observational