Journal list Promote Sponsor
verified SJR 0,245 · Q3 • database Scopus / SJR & Web of Science indexed
International Journal of Foundations of Computer Science
Singapore · World Scientific Publishing...
workspace_premium Q3 — Computer Science (miscellaneous) lock Subscription

International Journal of Foundations of Computer Science

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

ISSN: 0129-0541
Publisher: World Scientific Publishing Co. Pte Ltd
Category: Computer Science (miscellaneous)
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
0,245 Q3
H-index 45
Acceptance rate pie_chart
32%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
NPD Subscription
Non-OA path NPD

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,245

H-index

45

Docs (year)

71

Docs 3y

175

Total refs

1846

Cites 3y

147

Citable 3y

167

Cites/Doc 2y

0.87

Ref/Doc

26.0

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

AN IMPROVED QUANTUM SCHEDULING ALGORITHM

View more

WORD COMPLEXITY AND REPETITIONS IN WORDS

View more

COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES

View more

Constructivizing Membership Proofs in Complexity Classes

View more

COMPUTING AND COMBINATORICS CONFERENCE - COCOON'02

View more

Complexity of Task Graph Scheduling with Fixed Communication Capacity

View more

Communication Issues in Parallel Systems with Optical Interconnections

View more

CODING WITH MINIMAL PROGRAMS

View more

CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES

View more

Classifying Predicates and Languages

View more

APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES

View more

APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES

View more
SHOW MORE ARTICLES

ANALYSIS OF QUANTUM FUNCTIONS

View more

A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES

View more

AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

View more

AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS

View more

A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES

View more

A Scalable Diffusion Algorithm for Dynamic Mapping and Load Balancing on Networks of Arbitrary Topology

View more

A ROBUST DNA COMPUTATION MODEL THAT CAPTURES PSPACE

View more

A Process Algebraic Approach to Time Granularity Semantics

View more

A Note on the Dimensionality of Modified Knodel Graphs

View more

A NOTE ON REBOUND TURING MACHINES

View more

A NEW WEIGHT BALANCED BINARY SEARCH TREE

View more

A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES

View more

FAQs