Integer Square Root Algorithms

Integer Square Root Algorithms is an algorithmic method in computational number theory that computes the largest integer less than or equal to the square root of a given non-negative integer, distinguished from other root-finding or numerical approximation methods by its exactness and integral output constraint.

20

Publications

422

Citations

33

Authors

36

Institutions

Publications per year

2017–2026

0

Authors

33

  1. HK
    Hervé Knochel

    Université de Perpignan, France

    1 publications · 21 citations

    1

    h-index

  2. TJ
    Timothy J. Rolfe

    University of Chicago, United States

    1 publications · 10 citations

    1

    h-index

  3. KM
    Kurt Mehlhorn

    Max Planck Institute for Informatics, Germany

    1 publications · 12 citations

    1

    h-index

  4. AM
    Achintya Mukhopadhyay

    Jadavpur University, India

    1 publications · 59 citations

    1

    h-index

  5. MC
    Manfred Cochefert

    Université de Lorraine, France

    1 publications · 13 citations

    1

    h-index

1–5 of 33

Venues

  1. IEEE Transactions on Computers

    2 publications · 44 citations

    2

    h-index

  2. Communications of the ACM

    1 publications · 12 citations

    1

    h-index

  3. Quality Engineering

    1 publications · 13 citations

    1

    h-index

  4. Integration

    1 publications · 12 citations

    1

    h-index

  5. Journal of Computer and System Sciences

    1 publications · 35 citations

    1

    h-index

1–5