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
Parents
20
Achintya Mukhopadhyay · Journal of Combinatorial Theory · 1967 · 59 citations
Integer factoring and modular square roots
Emil Jeřábek · Journal of Computer and System Sciences · 2015 · 35 citations · Full text
Efficient Algorithms for Pairing-Based Cryptosystems
2004 · 32 citations
1–5 of 20
33
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 33
36
Wesleyan University
Middletown, United States
1 h-index
1 publications
11 citations

Northern Illinois University
DeKalb, United States
1 h-index
1 publications
23 citations
Instituto Tecnológico y de Estudios Superiores de Occidente
Tlaquepaque, Mexico
1 h-index
1 publications
10 citations
University of Primorska
Koper, Slovenia
1 h-index
1 publications
20 citations

Tata Institute of Fundamental Research
Mumbai, India
1 h-index
1 publications
59 citations
Queen's University Belfast
Belfast, United Kingdom
1 h-index
1 publications
10 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
21 citations

University of Minnesota
Minneapolis, United States
1 h-index
1 publications
10 citations
1–8 of 36
2 publications · 44 citations
2
h-index
1 publications · 12 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 35 citations
1
h-index
1–5