MathSciNet Relay Station
MathSciNet bibliographic data
MR1339115 (96h:11128) 11Y16
Jebelean, Tudor A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers. Design and implementation of symbolic computation systems (Gmunden, 1993). J. Symbolic Comput. 19 (1995), no. 1-3, 145--157.
Article
 
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2009, American Mathematical Society
Privacy Statement