Commutative Algebra Algorithms

Commutative Algebra Algorithms is a systematic computational methodology within symbolic computation that specializes in solving problems involving commutative rings, ideals, and modules through algorithmic techniques such as Gröbner basis computation, primary decomposition, and syzygy module construction.

53

Publications

4.3K

Citations

93

Authors

64

Institutions

Publications per year

2017–2026

1

Authors

93

  1. GB
    Gilbert Baumslag

    City College of New York, United States

    2 publications · 60 citations

    2

    h-index

  2. JF
    Jean‐Charles Faugère

    Sorbonne Université, France

    2 publications · 40 citations

    2

    h-index

  3. IH
    Ian H. Dinwoodie

    Duke University, United States

    1 publications · 89 citations

    1

    h-index

  4. RL
    R.J. Lipton

    Princeton University, United States

    1 publications · 14 citations

    1

    h-index

  5. CG
    Christina Graves

    The University of Texas at Tyler, United States

    1 publications · 39 citations

    1

    h-index

1–5 of 93

Venues

  1. Choice Reviews Online

    CRO · 4 publications · 2.2K citations

    4

    h-index

  2. Theoretical Computer Science

    2 publications · 91 citations

    2

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 2 publications · 45 citations

    2

    h-index

  4. Journal of Pure and Applied Algebra

    2 publications · 52 citations

    2

    h-index

  5. Journal of Symbolic Computation

    2 publications · 75 citations

    2

    h-index

1–5