1. Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
2. Bleichenbacher, D., Flammenkamp, A.: An efficient algorithm for computing shortest addition chains. Submitted (http://www.homes.uni-bielefeld.de/achim/addition_chain.html).
3. Chin, Y. H., Tsai, Y. H.: Algorithms for finding the shortest addition chain. Proc. National Computer Symp., Kaoshiung, Taiwan, December 20–22, 1985, pp. 1398–1414.
4. An efficient variation of bubble sort