Existence of a limiting distribution for the binary GCD algorithm (Q924557): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2006.03.013 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171220019 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0504426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational problems associated with Racah algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of the binary Euclidean algorithm: Functional analysis and operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical analysis of α-Euclidean algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2006.03.013 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:15, 10 December 2024

scientific article
Language Label Description Also known as
English
Existence of a limiting distribution for the binary GCD algorithm
scientific article

    Statements

    Existence of a limiting distribution for the binary GCD algorithm (English)
    0 references
    0 references
    16 May 2008
    0 references
    binary gcd algorithm
    0 references
    fixed point
    0 references
    analysis of algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references