References

Bahig, H.M., 2006. Improved generation of minimal addition chains. Comput., 78: 161-172.
CrossRef  |  Direct Link  |  

Bahig, H.M., 2011. Star reduction among minimal length addition chains. Comput., 91: 335-352.
CrossRef  |  Direct Link  |  

Balega, E.G., 1976. The additive complexity of a natural number. Soviet Math. Doklad, 17: 5-9.

Bos, J. and M. Coster, 1989. Addition Chain Heuristics. In: The Theory and Application of Cryptology. Brassard, G. (Ed.). Springer, New York, USA., ISBN: 978-0-387-97317-3, pp: 400-407.

Brauer, A., 1939. On addition chains. Bull. Am. Math. Soc., 45: 736-739.
CrossRef  |  Direct Link  |  

Clift, N.M., 2011. Calculating optimal addition chains. Comput., 91: 265-284.
CrossRef  |  Direct Link  |  

Cortes, N.C., F.R. Henriquez and C.A.C. Coello, 2008. An artificial immune system heuristic for generating short addition chains. IEEE. Trans. Evol. Comput., 12: 1-24.
CrossRef  |  Direct Link  |  

Dellac, H., 1894. Question 49. L'Intermediaire des Mathematiciens, 1: 20-20.

Dominguez-Isidro, S., E. Mezura-Montes and Osorio-Hernandez, 2015. Evolutionary programming for the length minimization of addition chains. Eng. Appl. Artif. Intelligence, 37: 125-134.
CrossRef  |  Direct Link  |  

Downey, P., B. Leong and R. Sethi, 1981. Computing sequences with addition chains. SIAM J. Comput., 10: 638-646.
Direct Link  |  

Javier, A.L., N.C. Cortes, M.A.M. Armendariz, and S.O. Jimenez, 2009. Finding Minimal Addition Chains with a Particle Swarm Optimization Algorithm. In: Mexican International Conference on Artificial Intelligence. Arturo, H.A., M.B. Raul and A.R.G. Carlos (Eds.). Springer Berlin Heidelberg, Berlin, Germany, ISBN: 978-3-642-05257-6, pp: 680-691.

Jose-Garcia, A., H. Romero-Monsivais, C.G. Hernandez-Morales, A. Rodriguez-Cristerna and I. Rivera-Islas et al., 2011. A Simulated Annealing Algorithm for the Problem of Minimal Addition Chains. In: Portuguese Conference on Artificial Intelligence. Antunes, L. and H.S. Pinto (Eds.). Springer Berlin Heidelberg, Berlin, Germany, ISBN: 978-3-642-24768-2, pp: 311-325.

Knuth, D.E., 1998. Evaluation of Powers. In: Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd Edition, Knuth, D.E. (Ed.)., Addison-Wesley, USA., pp: 461-485.

Koc, C.K., 1995. Analysis of sliding window techniques for exponentiation. Comput. Math. Appl., 30: 17-24.
CrossRef  |  Direct Link  |  

Lee, Y., H. Kim, S.M. Hong and H. Yoon, 2006. Expansion of sliding window method for finding shorter addition/subtraction-chains. Intl. J. Netw. Secur., 2: 34-40.
Direct Link  |  

Mignotte, M. and A. Tall, 2011. A note on addition chains. Intl. J. Algebra, 5: 269-274.
Direct Link  |  

Nedjah, N. and L.D.M. Mourelle, 2006. Towards minimal addition chains using ant colony optimisation. J. Math. Modell. Algorithms, 5: 525-543.
CrossRef  |  Direct Link  |  

Osorio-Hernandez, L.G., E. Mezura-Montes, N. Cruz-Cortes and F. Rodriguez-Henriquez, 2009. A genetic algorithm with repair and local search mechanisms able to find minimal length addition chains for small exponents. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, May 18-21, 2009, Trondheim, pp: 1422-1429.

Park, H., K. Park and Y. Cho, 1999. Analysis of the variable length nonzero window method for exponentiation. Comput. Math. Appl., 37: 21-29.
CrossRef  |  Direct Link  |  

Scholz, A., 1937. Aufgaben und losungen, 253. Jahresbericht der Deutschen Mathematiker-Vereinigung, 47: 41-42.

Thurber, E.G., 1973. On addition chains $1 (mn)\ leq 1 (n)-b $ and lower bounds for $ c (r) $. Duke Math. J., 40: 907-913.
CrossRef  |  Direct Link  |  

Thurber, E.G., 1999. Efficient generation of minimal length addition chains. SIAM J. Comput., 28: 1247-1263.
CrossRef  |  Direct Link  |  

Yao, A.C.C., 1976. On the evaluation of powers. SIAM J. Comput., 5: 100-103.
Direct Link  |