Last update: Thu May 16 02:07:42 MDT 2019
@Article{Akhavi:2000:ABC, author = "Ali Akhavi and Brigitte Vall{\'e}e", title = "Average Bit-Complexity of {Euclidean} Algorithms", journal = j-LECT-NOTES-COMP-SCI, volume = "1853", pages = "373--??", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:08:44 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1853.htm; http://www.math.utah.edu/pub/tex/bib/lncs2000.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1853/18530373.htm; http://link.springer-ny.com/link/service/series/0558/papers/1853/18530373.pdf", acknowledgement = ack-nhfb, }