You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
A new algorithm and refined bounds for extended gcd computation
|
---|---|
Chapter number | 50 |
Book title |
Algorithmic Number Theory
|
Published by |
Springer, Berlin, Heidelberg, May 1996
|
DOI | 10.1007/3-540-61581-4_50 |
Book ISBNs |
978-3-54-061581-1, 978-3-54-070632-8
|
Authors |
David Ford, George Havas |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |