Square root algorithm in F_q for q ≡ 2^s + 1(mod 2^s+1)KOO, Namhun; GOOK HWA CHO; KWON, Soonhak et al.Electronics letters. 2013, Vol 49, Num 7, pp 467-469, issn 0013-5194, 3 p.Article

Régularité optimale de racines carrées = Optimal regularity for square rootsLIONS, P.-L; VILLANI, C.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 321, Num 12, pp 1537-1541, issn 0764-4442Article

Fast square root architecture based on prediction of result bitsMUKESH SHARMA; WAGH, M. D.International journal of electronics. 1992, Vol 73, Num 6, pp 1121-1132, issn 0020-7217Article

A modified Babylonian algorithmKNILL, R. J.The American mathematical monthly. 1992, Vol 99, Num 8, pp 734-737, issn 0002-9890Article

On the square root of the Laplace-Beltrami operator as a HamiltonianPUZIO, R.Classical and quantum gravity (Print). 1994, Vol 11, Num 3, pp 609-620, issn 0264-9381Article

On two sequences of algorithms for approximating square rootsYEYIOS, A. K.Journal of computational and applied mathematics. 1992, Vol 40, Num 1, pp 63-72, issn 0377-0427Article

Realisation of irrational immittances containing a square rootRAMACHANDRAN, V; GARGOUR, C. S; AHMADI, M et al.IEE proceedings. Part G. Electronic circuits and systems. 1987, Vol 134, Num 1, pp 55-56, issn 0143-7089Article

A characterization of commutators of idempotentsDRNOVSEK, Roman; RADJAVI, Heydar; ROSENTHAL, Peter et al.Linear algebra and its applications. 2002, Vol 347, pp 91-99, issn 0024-3795Article

New error bounds for the linear complementarity problemLUO, Z.-Q; MANGASARIAN, O. L; REN, J et al.Mathematics of operations research. 1994, Vol 19, Num 4, pp 880-892, issn 0364-765XArticle

Largest prime factorKEMENY, J. G.Journal of pure and applied algebra. 1993, Vol 89, Num 1-2, pp 181-186, issn 0022-4049Article

Square roots modulo pTORNARIA, Gonzalo.Lecture notes in computer science. 2002, pp 430-434, issn 0302-9743, isbn 3-540-43400-3Conference Paper

A systolic serial squarer of continuous operationPEKMESTZI, K. Z; MOSHOPOULOS, N; KALIVAS, P et al.EUPSICO 2000 : European signal processing conference. 2000, pp 271-274, isbn 952-15-0443-9, 4VolConference Paper

User impersonation in key certification schemesLENSTRA, A. K; YACOBI, Y.Journal of cryptology. 1993, Vol 6, Num 4, pp 225-232, issn 0933-2790Article

A remark on 'reducing iteration time when result digit it zero for radix-2 SRT division and square root with redundant remaindersMONTUSCHI, P; CIMINIERA, L.IEEE transactions on computers. 1995, Vol 44, Num 1, pp 144-146, issn 0018-9340Article

Classification of the Tor-algebras of codimension four almost complete intersectionsKUSTIN, A. R.Transactions of the American Mathematical Society. 1993, Vol 339, Num 1, pp 61-85, issn 0002-9947Article

New square-root smoothing algorithmsPARK, P; KAILATH, T.IEEE transactions on automatic control. 1996, Vol 41, Num 5, pp 727-732, issn 0018-9286Article

Square rooting by iterative multiply-additionsITO, M; TAKAGI, N; YAJIMA, S et al.Information processing letters. 1996, Vol 60, Num 5, pp 267-269, issn 0020-0190Article

Square-root RTS smoothing algorithmsPOOGYEON PARK; KAILATH, T.International Journal of Control. 1995, Vol 62, Num 5, pp 1049-1060, issn 0020-7179Article

Unsigned SRT tables: theory and implementationDIRANEYYA, O. M; AMIN, A. A.Electronics letters. 2014, Vol 50, Num 13, pp 943-945, issn 0013-5194, 3 p.Article

New square-root algorithms for Kalman filteringPARK, P; KAILATH, T.IEEE transactions on automatic control. 1995, Vol 40, Num 5, pp 895-899, issn 0018-9286Article

Sur la longueur de la période du développement de √(n²+h) en fraction continue = On the length of the period of the continued fraction expansion of √(n²+h)AHMED FARHANE.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 316, Num 6, pp 537-540, issn 0764-4442Article

Computation of √x/d in a very high radix combined division/square-root unit with scaling and selection by roundingANTELO, E; LANG, T; BRUGUERA, J. D et al.IEEE transactions on computers. 1998, Vol 47, Num 2, pp 152-161, issn 0018-9340Article

A tight bound for approximating the square rootBSHOUTY, N. H; MANSOUR, Y; SCHIEBER, B et al.Information processing letters. 1997, Vol 63, Num 4, pp 211-213, issn 0020-0190Article

Efficient initial approximation for multiplicative division and square root by a multiplication with operand modificationITO, M; TAKAGI, N; YAJIMA, S et al.IEEE transactions on computers. 1997, Vol 46, Num 4, pp 495-498, issn 0018-9340Article

An iterative method for the computation of a matrix inverse square rootLAKIC, S.Zeitschrift für angewandte Mathematik und Mechanik. 1995, Vol 75, Num 11, pp 867-873, issn 0044-2267Article