On some applications of formulae of Ramanujan in the analysis of algorithms
- 1 June 1991
- journal article
- Published by Wiley in Mathematika
- Vol. 38 (1), 14-33
- https://doi.org/10.1112/s0025579300006409
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Zur Auswertung Gewisser Numerischer Reihen Mit Hilfe Modularer FunktionenPublished by Springer Nature ,1987
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- A Note on Gray Code and Odd-Even MergeSIAM Journal on Computing, 1980
- The number of registers required for evaluating arithmetic expressionsTheoretical Computer Science, 1979
- Modular transformations and generalizations of several formulae of RamanujanRocky Mountain Journal of Mathematics, 1977