Skip to Main content Skip to Navigation
Conference papers

One (more) line on the most Ancient Algorithm in History

Bruno Grenet 1 Ilya Volkovich 2
1 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We give a new simple and short ("one-line") analysis for the runtime of the well-known Euclidean Algorithm. While very short simple, the obtained upper bound in near-optimal.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02335368
Contributor : Bruno Grenet Connect in order to contact the contributor
Submitted on : Monday, October 28, 2019 - 11:34:55 AM
Last modification on : Wednesday, November 6, 2019 - 1:34:04 AM
Long-term archiving on: : Wednesday, January 29, 2020 - 2:09:41 PM

Files

hal.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Bruno Grenet, Ilya Volkovich. One (more) line on the most Ancient Algorithm in History. SOSA: Symposium on Simplicity in Algorithms, Jan 2020, Salt Lake City, United States. ⟨lirmm-02335368⟩

Share

Metrics

Record views

156

Files downloads

754