On some applications of formulae of Ramanujan in the analysis of algorithms (Q4005444): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular transformations and generalizations of several formulae of Ramanujan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Gray Code and Odd-Even Merge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Search Trees Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of registers required for evaluating arithmetic expressions / rank
 
Normal rank

Latest revision as of 10:53, 16 May 2024

scientific article
Language Label Description Also known as
English
On some applications of formulae of Ramanujan in the analysis of algorithms
scientific article

    Statements

    On some applications of formulae of Ramanujan in the analysis of algorithms (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    trie
    0 references
    transformation formulae
    0 references

    Identifiers