EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 29 / No 5 (1995) RAIRO-Theor. Inf. Appl., 29 5 (1995) 431-450 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 29, Number 5, 1995
Page(s) 431 - 450
DOI https://doi.org/10.1051/ita/1995290504311
Published online 01 February 2017
  1. 1. A. BRAUER, On Addition Chains, Bull. Amer. Math. Soc., 1939, 45, pp. 736-739. [Zbl: 65.0154.02] [MR: 245] [JFM: 65.0154.02] [Google Scholar]
  2. 2. F. BERGERON, J. BERSTEL and S. BRLEK, A Unifying Approach to the Generation of Addition Chains, Proc. XV Latin American Conf. on Informatics, Santiago, Chile, July 10-14, 1989, pp. 29-38. [Zbl: 0812.11072] [Google Scholar]
  3. 3. F. BERGERON, J. BERSTEL and S. BRLEK, Efficient Computation of Addition Chains, J. Théorie des Nombres de Bordeaux, 1994, 6, pp. 21-38. [EuDML: 247531] [MR: 1305286] [Zbl: 0812.11072] [Google Scholar]
  4. 4. F. BERGERON, J. BERSTEL, S. BRLEK and C. DUBOC, Addition Chains Using Continued Fractions, J. Algorithms, 1989, 10, pp. 403-412. [MR: 1006993] [Zbl: 0682.68025] [Google Scholar]
  5. 5. F. BERGERON and J. OLIVOS, Vectorial Addition Chains Using Euclid's Algorithm, Submitted. [Google Scholar]
  6. 6. J. BOS and M. COSTER, Addition Chain Heuristics, Proceedings of CRYPTO 89, 1989. - Some algorithms on addition chains and their complexity Tech. Rep. Center for Mathematics and Computer Sc. Amsterdam, 1990. [Google Scholar]
  7. 7. S. BRLEK, P. CASTÉRAN and R. STRANDH, Chaînes d'additions et structures de contrôle, Journées JFLA 91, 28-29 janvier 1991, Gresse-en-Vercors, France, Bigre, 1991, 72, pp. 54-63. [Google Scholar]
  8. 8. S. BRLEK, P. CASTÉRAN and R. STRANDH, On Addition Schemes, Proceedings of TAPSOFT91, April 8-12, 1991, Brighton, England, Lect. Notes in Comp. Sci., 1991, 494, pp. 379-393. [Google Scholar]
  9. 9. P. DOWNEY, B. LEONG and R. SETHI, Computing Sequences with Addition Chains, SIAM J. Computing, 1981, 10, pp. 638-646. [MR: 623072] [Zbl: 0462.68021] [Google Scholar]
  10. 10. D. E. KNUTH, The Art of Computer Programming, vol. 2, Addison-Wesley, 1981. [MR: 633878] [Zbl: 0477.65002] [Google Scholar]
  11. 11. F. MORAIN and J. OLIVOS, Speeding up the computations on an elliptic curve using addition-substraction chains, RAIRO Theo. Informatics and Appl., 1990, 6, 24, pp. 531-543. [EuDML: 92374] [Zbl: 0724.11068] [Google Scholar]
  12. 12. A. SCHÖNHAGE, A Lower Bound for the Length of Addition Chains, Theoretical Comp. Sci., 1975, pp. 1-12. [Zbl: 0307.68032] [Google Scholar]
  13. 13. E. G. THURBER, On Addition Chains l(mn) ≤ l(n) - b and Lower Bounds for c (r), Duke Math., J., 1973, 40, pp. 907-913. [Zbl: 0275.10027] [Google Scholar]
  14. 14. A. C.-C. YAO, On the Evaluation of Powers, SIAM J. Comp., 1976, 9, pp. 100-103. [Zbl: 0326.68025] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.