Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006804687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential decay of correlations for surface semi-flows without finite Markov partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean algorithms are Gaussian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of steps in the Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decay of correlations in Anosov flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of the continued fraction map and the spectral theory of \(\text{SL}(2,\mathbb{Z})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of steps in the Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates in the central limit theorems for combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclid's Algorithm for Large Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian laws for the main parameters of the Euclid algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Estimates for the Main Parameters of the Euclid Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thermodynamic formalism approach to Selberg’s zeta function for 𝑃𝑆𝐿(2,𝐙) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schönhage's algorithm and subquadratic integer gcd computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical analysis of a class of Euclidean algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean dynamics / rank
 
Normal rank

Latest revision as of 17:07, 1 July 2024

scientific article
Language Label Description Also known as
English
Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
scientific article

    Statements

    Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    Euclid algorithm
    0 references
    divide and conquer algorithms
    0 references
    fast multiplication
    0 references
    analysis of algorithms
    0 references
    transfer operators
    0 references
    Perron formula
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references