JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Dolgov, Dmitry Aleksandrovich
Statistics Math-Net.Ru
Total publications: 4
Scientific articles: 4
Presentations: 1
Number of views: This page: 300 Abstract pages: 679 Full texts: 261 References: 108
E-mail:
email
Keywords:
greatest common divisor, k-ary gcd algorithms, continuants
UDC:
511
Subject:
greatest common divisor, k-ary gcd algorithms, continuants
Main publications:
D.A. Dolgov., “GCD calculation in the search task of pseudoprime and strong pseudoprime numbers”, Lobachevskii Journal of Mathematics. , 37 :6 (2016), 734-739
https://www.mathnet.ru/eng/person140048
List of publications on Google Scholar
List of publications on ZentralBlatt
https://www.webofscience.com/wos/author/record/B-6263-2016
https://www.scopus.com/authid/detail.url?authorId=57191891626
https://www.researchgate.net/profile/Dmitry_Dolgov2
Publications in Math-Net.Ru Citations
2024
1.
D. A. Dolgov, “On the continued fraction with rational partial quotients”, Chebyshevskii Sb. , 25 :2 (2024), 43–66
2022
2.
D. A. Dolgov, “Continuants of continued fractions with rational incomplete quotients”, Diskr. Mat. , 34 :3 (2022), 34–51
3.
D. A. Dolgov, “On Analogues of Heilbronn's Theorem”, Mat. Zametki , 111 :6 (2022), 819–834 Math. Notes , 111 :6 (2022), 841–854
2018
4.
D. A. Dolgov, “An extended Jebelean–Weber–Sedjelmaci GCD algorithm”, Chebyshevskii Sb. , 19 :2 (2018), 421–431
Presentations in Math-Net.Ru
Organisations
Contact us: