ISSN: 0129-0541

Journal Home

Journal Guideline

International Journal of Foundations of Computer Science Q3 Unclaimed

World Scientific Publishing Co. Pte Ltd Singapore

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

International Journal of Foundations of Computer Science is a journal indexed in SJR in Computer Science (miscellaneous) with an H index of 43. It has an SJR impact factor of 0,346 and it has a best quartile of Q3. It has an SJR impact factor of 0,346.

Type: Journal

Type of Copyright:

Languages:

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Computer Science (miscellaneous) (Q3)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

International Journal of Foundations of Computer Science

0,346

SJR Impact factor

43

H Index

67

Total Docs (Last Year)

187

Total Docs (3 years)

1632

Total Refs

146

Total Cites (3 years)

179

Citable Docs (3 years)

0.81

Cites/Doc (2 years)

24.36

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

Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki Q3
Electronic Notes in Theoretical Computer Science Q3
Jordanian Journal of Computers and Information Technology Q3
IEEE Latin America Transactions Q3
International Journal of Electrical and Computer Engineering Q3

Compare this journals

Aims and Scope

Best articles by citations

CODING WITH MINIMAL PROGRAMS

REDUCED POWER AUTOMATA AND SOFIC SYSTEMS

DERANDOMIZED LEARNING OF BOOLEAN FUNCTIONS OVER FINITE ABELIAN GROUPS

ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS

COMPUTING AND COMBINATORICS CONFERENCE - COCOON'02

FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT

IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES

Geometric Transformations of Language Families: The Power of Symmetry

REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM

GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH

AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS

WORD COMPLEXITY AND REPETITIONS IN WORDS

SHOW MORE ARTICLES

ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS

RANDOM SEEKING: A GENERAL, EFFICIENT, AND INFORMED RANDOMIZED SCHEME FOR DYNAMIC LOAD BALANCING

Multitriangle: A Constant Node Degree Interconnection Network

Efficient Communication in Folded Petersen Networks

ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY

NEW EDITORS AT IJFCS

IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS

SPECIAL ISSUE ON INTERCONNECTION NETWORKS-EDITORS' FOREWORD

Special Issue on Interconnection Networks: Editors' Foreword

SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS

TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION

Pattern Languages Versus Parallel Communicating Grammar Systems