One (more) line on the most Ancient Algorithm in History
Data Structures and Algorithms
2019-10-17 v2
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.
Cite
@article{arxiv.1808.07957,
title = {One (more) line on the most Ancient Algorithm in History},
author = {Bruno Grenet and Ilya Volkovich},
journal= {arXiv preprint arXiv:1808.07957},
year = {2019}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
A Euclidean Algorithm for Binary Cycles with Minimal Variance
Luca Ghezzi, Roberto Baldacci
2018-04-05
Data Structures and Algorithms · Computer Science
Simple Lattice Basis Computation -- The Generalization of the Euclidean Algorithm
Kim-Manuel Klein, Janina Reuter
2023-11-28
Programming Languages · Computer Science
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds
Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar
2017-05-02
Optimization and Control · Mathematics
Almost Optimal Sublinear Time Algorithm for Semidefinite Programming
Dan Garber, Elad Hazan
2012-08-28
Statistics Theory · Mathematics
A lower bound on the expected optimal value of certain random linear programs and application to shortest paths and reliability
Stephane Chretien, Franck Corset
2016-02-16
Data Structures and Algorithms · Computer Science
Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
Kim-Manuel Klein, Janina Reuter
2024-11-08
Data Structures and Algorithms · Computer Science
Further analysis of the binary Euclidean algorithm
Richard P. Brent
2013-03-13
Neural and Evolutionary Computing · Computer Science
Multiplicative Drift Analysis
Benjamin Doerr, Daniel Johannsen, Carola Winzen
2013-01-18
Data Structures and Algorithms · Computer Science
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint
Alina Ene, Huy L. Nguyen
2018-11-20
Neural and Evolutionary Computing · Computer Science
A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes
Benjamin Doerr, Martin Krejca
2020-04-13
Data Structures and Algorithms · Computer Science
Euclidean TSP with few inner points in linear space
Pawel Gawrychowski, Damian Rusak
2014-06-10
Artificial Intelligence · Computer Science
Utilitarian Algorithm Configuration
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
2023-11-01
Neural and Evolutionary Computing · Computer Science
First Steps Towards a Runtime Analysis When Starting With a Good Solution
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2025-11-14
Dynamical Systems · Mathematics
Euclidean algorithms are Gaussian over imaginary quadratic fields
Dohyeong Kim, Jungwon Lee, Seonhee Lim
2025-10-27
Computational Geometry · Computer Science
A True $O(n \log{n}) $ Algorithm for the All-k-Nearest-Neighbors Problem
Hengzhao Ma, Jianzhong Li
2019-08-06
Neural and Evolutionary Computing · Computer Science
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
Dirk Sudholt
2015-03-19
Neural and Evolutionary Computing · Computer Science
A Tight Runtime Analysis for the $(\mu + \lambda)$ EA
Denis Antipov, Benjamin Doerr
2021-09-21
Neural and Evolutionary Computing · Computer Science
A Tight Runtime Analysis of the $(1+(\lambda, \lambda))$ Genetic Algorithm on OneMax
Benjamin Doerr, Carola Doerr
2015-06-22
Neural and Evolutionary Computing · Computer Science
Parameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
Andrew M. Sutton, Frank Neumann
2012-10-10
Optimization and Control · Mathematics
Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
Xufeng Cai, Jason M. Altschuler, Jelena Diakonikolas
2025-03-21
Computational Complexity · Computer Science
Tight running times for minimum $\ell_q$-norm load balancing: beyond exponential dependencies on $1/\epsilon$
Lin Chen, Liangde Tao, José Verschae
2021-07-14
Computational Geometry · Computer Science
Separating Overlapped Intervals on a Line
Shimin Li, Haitao Wang
2017-02-17
History and Overview · Mathematics
On The Euclidean Algorithm: Rhythm Without Recursion
Thomas Morrill
2022-06-28
Performance · Computer Science
On the Fair Comparison of Optimization Algorithms in Different Machines
Etor Arza, Josu Ceberio, Ekhiñe Irurozki, Aritz Pérez
2024-02-09
Computational Geometry · Computer Science
Euclidean Shortest Paths in Simple Cube Curves at a Glance
Fajie Li, Reinhard Klette
2007-05-23