Origins of the analysis of the Euclidean algorithm
From MaRDI portal
Cites work
- A characterization of parenthesis languages
- scientific article; zbMATH DE number 3119278 (Why is no real title available?)
- scientific article; zbMATH DE number 3896872 (Why is no real title available?)
- scientific article; zbMATH DE number 4039250 (Why is no real title available?)
- scientific article; zbMATH DE number 4061180 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 4127154 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3076614 (Why is no real title available?)
- Work for the Hairdressers: The Production of de Prony's Logarithmic and Trigonometric Tables
Cited in
(10)- Modular arithmetic before C. F. Gauss: systematizations and discussions on remainder problems in 18th-century Germany
- On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities
- Dynamical analysis of a class of Euclidean algorithms.
- A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm
- Maximum versus minimum: two properties of the Fibonacci sequence
- Dedekind sums in the vicinity of quadratic irrationals
- scientific article; zbMATH DE number 7368168 (Why is no real title available?)
- Length of the continued logarithm algorithm on rational inputs
- Tracing compressed curves in triangulated surfaces
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
This page was built for publication: Origins of the analysis of the Euclidean algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344935)