Information and Computation
Information and Computation is a journal indexed in SJR in Computational Theory and Mathematics and Information Systems with an H index of 85. It has an SJR impact factor of 0,493 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,493.
Metrics
Scimago and CountryOfPapers database fields
SJR Impact
0,493
H-index
85
Docs (year)
75
Docs 3y
337
Total refs
2827
Cites 3y
335
Citable 3y
319
Cites/Doc 2y
1.01
Ref/Doc
37.69
Immediate OA
—
Embargoed OA
NPD
Non OA / Submission
—
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.
Researcher reviews
Best articles by citations
Relative Undecidability in Term RewritingI. The Termination Hierarchy
View moreThe Small Model Property: How Small Can It Be?
View moreZero-Knowledge Arguments and Public-Key Cryptography
View moreUniform Self-Stabilizing Ring Orientation
View moreToward a theory of Pollard's rho method
View moreTight lower bounds for certain parameterized NP-hard problems
View moreThe Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
View moreTrace and Testing Equivalence on Asynchronous Processes
View moreSimilarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
View moreSeventh International Workshop on Foundations of Object-Oriented Languages
View moreRelativized perfect zero knowledge is not BPP
View moreRelative Undecidability in Term RewritingII. The Confluence Hierarchy
View moreStack size analysis for interrupt-driven programs
View moreReduction of Permutation-Invariant Polynomials
View moreReal numbers having ultimately periodic representations in abstract numeration systems
View morePrelogical Relations
View morePractical Algorithms for Deciding Path Ordering Constraint Satisfaction
View moreOnline Variable Sized Covering
View moreOn the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions
View moreOn the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs
View moreOn the existence of weak subgame perfect equilibria
View moreOn the complexity of the stability problem of binary freezing totalistic cellular automata
View moreOn the classification of recursive languages
View moreOn multi-partition communication complexity
View more