Accredited Standards Committee X9 (页面存档备份,存于互联网档案馆), American National Standard X9.62-2005, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), November 16, 2005.
Daniel R. L. Brown, Generic Groups, Collision Resistance, and ECDSA, Designs, Codes and Cryptography, 35, 119–152, 2005. ePrint version (页面存档备份,存于互联网档案馆)
Ian F. Blake, Gadiel Seroussi, and Nigel Smart, editors, Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Note Series 317, Cambridge University Press, 2005.
。增加和删除元素的操作则可能需要藉由一次或多次树旋转,以实现树的重新平衡。AVL树得名于它的发明者格奥尔吉·阿杰尔松-韦利斯基和葉夫根尼·蘭迪斯,他们在1962年的论文《An algorithm for the organization of information》中公开了这一数据结构。 节点的平衡因子是它的左子树的高度减去它的右
1785–1836. doi:10.4007/annals.2011.174.3.8. Lairez, Pierre. A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average
Narendra Karmarkar(英语:Narendra Karmarkar) - 线性规划中的Karmarkar算法(英语:Karmarkar's algorithm)。 1991: Martin E. Dyer, Alan M. Frieze 和 Ravindran Kannan - 基于隨機漫步的计算凸体体积的近似算法。
computations in generic groups(页面存档备份,存于互联网档案馆), PhD thesis, M.I.T., 2007. D. C. Terr, A modification of Shanks’ baby-step giant-step algorithm, Mathematics