Congruence Solving Algorithms

Congruence Solving Algorithms is a class of algorithmic methods in number theory that systematically determine integer solutions to modular congruences by exploiting properties of residue classes, algebraic structures, and efficient computational techniques specific to congruence relations.

63

Publications

2K

Citations

101

Authors

60

Institutions

Publications per year

2017–2026

2

Authors

101

  1. SS
    Stefan Schirra

    Max Planck Institute for Informatics, Germany

    3 publications · 105 citations

    3

    h-index

  2. CL
    C. L. Stewart

    University of Waterloo, Canada

    2 publications · 113 citations

    2

    h-index

  3. PJ
    Paul J. Heffernan

    University of Memphis, United States

    2 publications · 92 citations

    2

    h-index

  4. JD
    Jiří Demel

    Charles University, Czechia

    2 publications · 21 citations

    2

    h-index

  5. AD
    Andrii Dmytryshyn

    Umeå University, Sweden

    1 publications · 15 citations

    1

    h-index

1–5 of 101

Venues

  1. Mathematics of Computation

    MCOM · 4 publications · 99 citations

    4

    h-index

  2. Journal of Symbolic Computation

    3 publications · 62 citations

    3

    h-index

  3. Journal of the American Mathematical Society

    JAMS · 2 publications · 113 citations

    2

    h-index

  4. ACM Transactions on Mathematical Software

    TOMS · 2 publications · 22 citations

    2

    h-index

  5. Computational Geometry

    2 publications · 99 citations

    2

    h-index

1–5