ISSN: 1549-6325

Journal Home

Journal Guideline

ACM Transactions on Algorithms Q1 Unclaimed

Association for Computing Machinery (ACM) United States

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

ACM Transactions on Algorithms is a journal indexed in SJR in Mathematics (miscellaneous) with an H index of 59. It has an SJR impact factor of 1,555 and it has a best quartile of Q1. It has an SJR impact factor of 1,555.

Type: Journal

Type of Copyright:

Languages:

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Mathematics (miscellaneous) (Q1)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

1,555

SJR Impact factor

59

H Index

43

Total Docs (Last Year)

118

Total Docs (3 years)

1714

Total Refs

221

Total Cites (3 years)

115

Citable Docs (3 years)

1.86

Cites/Doc (2 years)

39.86

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

Acta Numerica Q1
Annals of Mathematics Q1
Publications Mathematiques Q1
Journal of the American Mathematical Society Q1
Acta Mathematica Q1

Compare this journals

Aims and Scope

Best articles by citations

The NP-completeness column

Better Scalable Algorithms for Broadcast Scheduling

Jitter regulation for multiple streams

Resilient dictionaries

The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity

Getting the best response for your erg

Approximate Privacy

Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms

An algorithm for deciding zero equivalence of nested polynomially recurrent sequences

Optimal Lower and Upper Bounds for Representing Sequences

Socially desirable approximations for dodgson's voting rule

Sharing the cost more efficiently

SHOW MORE ARTICLES

I/O-efficient batched union-find and its applications to terrain analysis

An optimal decomposition algorithm for tree edit distance

Adversarial Queuing on the Multiple Access Channel

Simultaneous source location

A compact routing scheme and approximate distance oracle for power-law graphs

On hard instances of approximate vertex cover

A Bounded Budget Network Creation Game

Generating rooted and free plane trees

Competitive buffer management for shared-memory switches

Kinetic and dynamic data structures for closest pair and all nearest neighbors

Prize-collecting steiner network problems

Structure and linear-time recognition of 4-leaf powers