A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1976) 278--317.
A.G. Akritas and S.D. Danielopoulos, A converse rule of signs for polynomials, Computing 34 (1985) 283--286.
A.G. Akritas, A simple proof of the validity of the reduced prs algorithm, Computing 38 (1987) 369--372.
A.G. Akritas, A new method for computing polynomial greatest common divisors and remainder sequences, Numer. Math. 52 (1988) 119--127.
A.G. Akritas and S.D. Danielopoulos, An unknown theorem for the isolation of the roots of polynomials, Ganita Bharati 2 (1980) 41--49.
A.G. Akritas and G.E. Collins, Polynomial real root isolation using Descartes' rule of signs, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation, Yorktown Heights, NY (Assoc. Comput. Machinery, New York, 1976) 272--275.
A.G. Akritas, On the Budan--Fourier controversy, ACM SIGSAM Bull. 15 (1981) 8--10.
A.A. Albert, An inductive proof of Descartes' rule of sign, Amer. Math. Monthly 50 (1943) 178--180.
A.A. Albert, Introduction to Algebraic Theories (Univ. of Chicago Press, Chicago, IL, 1941).
Duhamel and Prouhet, Correspondance, Nouv. Ann. Math. Ser. 2 6 (1867) 427--429.
B.D.O. Anderson, On the computation of the Cauchy index, Quart. Appl. Math. 29 (1972) 577--582.
B.D.O. Anderson and E.I. Jury, Generalized Bezoutian and Sylvester matrices in multivariable linear control, Proc. IEEE Conf. on Decision Control (1976) 901--906.
J.W. Archbold, Algebra (Pitman, London, 3rd ed., 1964) 122--133; 174--207.
M. Bôcher, Introduction to Higher Algebra (Dover, New York, 1964) Chapters 14, 15.
M. Bôcher, The published and unpublished work of Charles Sturm on algebraic and differential equations, Bull. Amer. Math. Soc. 18 (1912) 1--18.
O. Baier, Die Hurwitzschen Bedingungen, Z. Angew. Math. Mech. 28 (1948) 153--157.
A.I. Balinskii, Expressions for the resultant and discriminant of polynomials, Mat. Metody i Fiz.-Mekh. Polya 4 (1976) 74--75; 103.
E.J. Barbeau, Polynomials (Springer, New York, 1989).
S. Barnard and J.M. Child, Higher Algebra (Macmillan, New York, 1936) 81--105; 179--199; 446--466.
S. Barnett, Solution of ax+by=d for generalized polynomials, in: Proc. 23rd IEEE Conf. on Decision and Control, Las Vegas, NV (1984) 1766--1767.
S. Barnett, Congenial matrices, Linear Algebra Appl. 41 (1981) 277--298.
S. Barnett, Division of generalized polynomials using the comrade matrix, Linear Algebra Appl. 60 (1984) 159--175.
S. Barnett, Regular polynomial matrices having relatively prime determinants, Proc. Cambridge Philos. Soc. 65 (1969) 585--590.
S. Barnett, Degrees of greatest common divisors of invariant factors of two regular polynomial matrices, Proc. Cambridge Philos. Soc. 66 (1969) 241--245.
S. Barnett, Greatest common divisors from generalized Sylvester resultant matrices, Linear and Multilinear Algebra 8 (1980) 271--279.
S. Barnett, A companion matrix analogue for orthogonal polynomials, Linear Algebra Appl. 12 (1975) 197--208.
S. Barnett, A new look at classical algorithms for polynomial resultant and G.C.D. calculation, SIAM Rev. 16 (1974) 193--205.
S. Barnett, Location of zeros of a complex polynomial, Linear Algebra Appl. 4 (1971) 71--76.
S. Barnett, Regular greatest common divisor of two polynomial matrices, Proc. Cambridge Philos. Soc. 72 (1972) 161--165.
S. Barnett, A note on the Bezoutian matrix, SIAM J. Appl. Math. 22 (1972) 84--86.
S. Barnett, Greatest common divisor of several polynomials, Proc. Cambridge Philos. Soc. 70 (1971) 263--268.
S. Barnett, Relationship between two methods for calculating the least order of a transfer function matrix, Internat. J. Control 15 (1972) 509--512.
S. Barnett, Euclidean remainders for generalized polynomials, Linear Algebra Appl. 99 (1988) 111--122.
S. Barnett and P. Lancaster, Some properties of the Bezoutian for polynomial matrices, Linear and Multilinear Algebra 9 (1980) 99--110.
S. Barnett, Forms of the resultant of two polynomials, Amer. Math. Monthly 93 (1986) 551--552.
S. Barnett, Greatest common divisor of two polynomials, Linear Algebra Appl. 3 (1970) 7--9.
S. Barnett, Polynomials and Linear Control Systems (Marcel Dekker, New York, 1983).
S. Barnett, Matrices, polynomials and linear time-invariant systems, IEEE Trans. Automat. Control 18 (1973) 1--10.
S. Barnett, Qualitative analysis of polynomials using matrices, IEEE Trans. Automat. Control 15 (1970) 380--382.
S. Barnett and D. Siljak, Routh's algorithm, a centennial survey, SIAM Rev. 19 (1977) 472--489.
S. Barnett, Interchangeability of the Routh and Jury tabular algorithms for linear system zero location, in: IEEE Conf. on Decision and Control, San Diego (1973) 308--314.
S. Barnett, Generalized polynomials and linear systems theory, in: J.E. Marshall et al., Eds., Proc. Third IMA Conf. on Control Theory (Academic Press, London, 1981) 3--30.
S. Barnett, A new formulation of the theorems of Hurwitz, Routh, and Sturm, J. Inst. Math. Appl. 8 (1971) 240--250.
G. Bauer, Vorlesungen über Algebra (Teubner, Leipzig, 1903).
M. Ben-Or, E. Feig, D. Kozen and P. Tiwari, A fast parallel algorithm for determining all roots of a polynomial with real roots, in: Proc. 18th Annual ACM Symp. on Theory of Computing (1986) 340--349; also: SIAM J. Comput. 17 (1988) 1081--1092.
M. Ben-Or, D. Kozen and J. Reif, The complexity of elementary algebra and geometry, in: 16th Annual ACM Symp. on Theory of Computing (1984) 457--464.
M. Ben-Or and P. Tiwari, Simple algorithms for approximating all roots of a polynomial with real roots, J. Complexity 6 (1990) 417--442.
I.S. Berezin and N.P. Zhidkov, Computing Methods, Vol. 2 (Pergamon Press, Oxford, 1965) Chapter 7.
E.R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970) 713--735.
C. Biehler, Sur une application de la méthode de Sturm, Nouv. Ann. Math. Ser. 2 19 (1880) 76--81.
D. Bini and L. Gemignani, On the Euclidean scheme for polynomials having interlaced real zeros, in: Proc. 2nd Ann. ACM Symposium on Parallel Algorithms and Architecture, Crete, Greece (1990) 254--258.
D. Bini and V. Pan, Polynomial division and its computational complexity, J. Complexity 2 (1986) 179--203.
R.R. Bitmead and B.D.O. Anderson, The matrix Cauchy index: Properties and applications, SIAM J. Appl. Math. 33 (1977) 655--672.
R.R. Bitmead, S.Y. Kung, B.D.O. Anderson and T. Kailath, Greatest common divisors via generalized Sylvester and Bezoutian matrices, IEEE Trans. Automat. Control 23 (1978) 1043--1047.
W.A. Blankinship, A new version of the Euclidean algorithm, Amer. Math. Monthly 70 (1963) 742--745.
C.W. Borchardt, Développements sur l'équation à l'aide de laquelle on détermine les inégalités séculaires du mouvement des planètes, J. Math. Pures Appl. (1) 12 (1847) 50--67.
A. Borodin, J. Von zur Gathen and J. Hopcroft, Fast parallel matrix and GCD computations, in: Proc. 23rd IEEE Symp. on Foundations of Computer Science (1982) 65--71; also: Inform. and Control 52 241--256.
A. Borodin and I. Munro, The Computational Complexity of Algebraic and Numerical Problems (Elsevier, New York, 1977) 54--76; 132--137; 148--150.
S. Borofsky, Elementary Theory of Equations (Macmillan, New York, 1950).
R.P. Brent, H.T. Kung and F.T. Luk, Some linear-time algorithms for systolic arrays, in: Proc. IFIP 9th World Computer Congress (1983) 865--876.
R.P. Brent and H.T. Kung, Systolic VLSI arrays for linear-time GCD computations, in: F. Anceau and E.J. Aas, Eds., VLSI '83 (North-Holland, Amsterdam, 1983) 145--154.
R.P. Brent and H.T. Kung, Systolic VLSI arrays for polynomial GCD computation, IEEE Trans. Comput. ?? (1984) 731--736.
F. Brioschi, Sur les fonctions de Sturm, Nouv. Ann. Math. 13 (1854) 71--80.
F. Brioschi, Sur les séries qui donnent le nombre de racines réelles des équations algébriques à une ou à plusieurs inconnues, Nouv. Ann. Math. 15 (1856) 264--286.
W.S. Brown and J.F. Traub, On Euclid's algorithm and the theory of subresultants, J. Assoc. Comput. Mach. 18 (1971) 505--514.
W.S. Brown, On Euclid's algorithm and the computation of polynomial greatest common divisors, J. Assoc. Comput. Mach. 18 (1971) 478--504.
W.S. Brown, On the subresultant PRS algorithm, in: Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1976) 271.
W.S. Brown, The subresultant PRS algorithm, ACM Trans. Math. Software 4 (1978) 237--249.
D. Budan, Nouvelle Méthode pour la Résolution des Équations de Degré Quelquonque (Paris, 1807).
W.S. Burnside and A.W. Panton, Theory of Equations, 1 (Dover, New York, 1960) 165--167.
F. Cajori, A History of Mathematics (Macmillan, New York, 2nd ed., 1919).
F. Cajori, An Introduction to the Modern Theory of Equations (Macmillan, New York, 1904).
C. Candèze, Sur le théorème de Sturm, Nouv. Ann. Math. Ser. 2 20 (1881) 193--197.
A. Cauchy, Sur la résolution des équations numériques et sur la théorie d'élimination, in: Oeuvres Complètes Sér. 2 9 (Gauthier-Villars, Paris, 1891) 87--161.
A. Cauchy, Calcul des indices des fonctions, J. École Poly. Ser. 2 15 (1837) 176--229; also: in: Oeuvres Complètes Sér. 2 1 (Gauthier-Villars, Paris) 416--466.
A. Cauchy, Mémoire sur la détermination du nombre des racines réelles dans les équations algébriques, J. École Poly. 17 (1815) 457; also: in: Oeuvres Complètes Sér. 2 1 (Gauthier-Villars, Paris) 170--257.
B.F. Caviness and M. Rothstein, A modular greatest common divisor algorithm for Gaussian polynomials, in: ACM '75 Conf. Proc. (1975) 270--273.
B.F. Caviness, Computer Algebra: Past and Future, Eurocal 85 (Springer, New York, 1985) 1--18.
A. Cayley, Nouvelles recherches sur les fonctions de M. Sturm, J. Math. Pures Appl. 13 (1848) 269--274.
A. Cayley, Note sur la méthode d'elimination de Bezout, J. Reine Angew. Math. 53 (1857) 366--367.
A. Cayley, On the geometrical presentation of Cauchy's theorems of root-limitation, Trans. Cambridge Philos. Soc. 12 (2) (1877) 395--413; also: in: Collected Mathematical Papers, 9, 21--39.
A. Cayley, Tables of the Sturmian functions for equations of the second, third, fourth, and fifth degrees, Philos. Trans. Roy. Soc. London 147 (1857) 733--736.
A. Cayley, A discussion of the Sturmian constants for cubic and quartic equations, Quart. J. Pure Appl. Math. 4 (1861) 7--12.
B.W. Char, K.O. Geddes and G.H. Gonnet, GCDHEU: heuristic polynomial GCD algorithm based on integer GCD computation, in: J. Fitch, Ed., EUROSAM 84, Lecture Notes in Comput. Sci. 174 (Springer, New York, 1984) 285--296.
S.K. Chatterjea, A note on Rouche's theorem, Mat. Vesnik 10 (25) (1973) 297--298.
G. Chrystal, Algebra, 1 (Chelsea, New York, 1959).
G. Claessens, On the location of zeros of a generalized polynomial, Linear Algebra Appl. 22 (1978) 79--88.
A. Clark, Elements of Abstract Algebra (Wadsworth, Belmont, CA, 1971).
A. Colagrossi and A.M. Miola, Computing real zeros of polynomials with parametric coefficients, SIGSAM Bull. 17 (1) (1983) 12--15.
G.E. Collins and R.G.K. Loos, Real zeros of polynomials, Comput. Suppl. 4 (1982) 83--94.
G.E. Collins, PM, a system for polynomial manipulation Comm. ACM 8 (1966) 578--589.
G.E. Collins, Subresultants and reduced polynomial remainder sequences, J. Assoc. Comput. Mach. 14 (1967) 128--142.
G.E. Collins, Polynomial remainder sequences and determinants, Amer. Math. Monthly 73 (1966) 708--712.
G.E. Collins, The calculation of multivariate polynomial resultants, J. Assoc. Comput. Mach. 18 (1971) 515--532.
G.E. Collins, Comment on a paper by Ku and Adler, Comm. ACM 12 (1969) 302.
G.E. Collins and R.G.K. Loos, Polynomial real root isolation by differentiation, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation, Yorktown Heights, NY (Assoc. Computing Machinery, New York, 1976) 15--25.
G.E. Collins, Computer algebra of polynomials and rational functions, Amer. Math. Monthly 80 (1973) 725--755.
G.E. Collins, Infallible calculation of polynomial zeros to specified precision, in: Mathematical Software III (Academic Press, New York, 1977) 35--68.
G.E. Collins, Computing Time Analyses for Some Arithmetic and Algorithms, in: R.G. Tobey, Ed., Proc. 1968 Summer Institute on Symbolic Mathematical Computation, 195--231.
N.B. Conkwright, Introduction to the Theory of Equations (Ginn, Boston, MA, 1941).
E. Cotton and M.M. Yuan, Sur les critères de stabilité de Routh et de Hurwitz, Bull. Sci. Math. (2) 72 (1948) 115--128.
D.R. Curtiss, Extensions of Descartes' rule of signs connected with a problem suggested by Laguerre, Trans. Amer. Math. Soc. 16 (1915) 350--360.
D.R. Curtiss, Recent extensions of Descartes' rule of signs, Ann. of Math. 19 (1917--1918) 251--278.
D.R. Curtiss, An extension of Descartes' rule of signs, Math. Ann. 73 (1913) 424--435.
G. Darboux, Mémoire sur le théorème de Sturm, Bull. Sci. Math. Astr. Ser. 1 8 (1875) 56--63; 92--111.
M. Darboux, Questions, Nouv. Ann. Math. Ser. 2 7 (1868) 137--138.
B.N. Datta, Controllability, Bezoutian and relative primeness, Internat. J. Math. Math. Sci. 3 (1980) 185--188.
J.H. Davenport, Y. Siret and E. Tournier, Computer Algebra (Academic Press, London, 1988).
C. Davies and Peck, Extraction of roots, Sturm's theorem, square roots, cube roots, cubic equations, in: Mathematical Dictionary and Cyclopedia of Mathematical Science (Barnes, 1876) 140--145; 242; 534; 539--542.
R. de Montessus, De l'usage pratique du théorème de Sturm, Nouv. Ann. Math. Ser. 4 9 (1909) 235--243.
A. De Moigno, Note sur la détermination du nombre des racines réelles ou imaginaires d'une équation numérique, comprises entre des limites données, J. Math. Pures Appl. 5 (1840) 75--94.
J. De Vries, Über gewisse Sturmsche Ketten, Nieuw Arch. Wisk. (2) 3 (1895) 40--52.
L. Derwidué, Introduction à l'algèbre supérieure et au calcul numérique algébrique, Masson et Cie, Paris (1957).
L. Derwidué, Une méthode par séparation de calcul des racines complexes des équations algébriques, Mathesis 66 (1957) 354--359.
L.E. Dickson, Elementary Theory of Equations (Wiley, New York, 1914).
L.E. Dickson, First Course in the Theory of Equations (Wiley, New York, 1922).
L.E. Dickson, New First Course in the Theory of Equations (Wiley, New York, 1952).
J. Dieudonné, Calcul Infinitésimal (Hermann, Paris, 1968).
D. Dobbs and R. Hanks, A modern course on the theory of equations (Polygonal Publishers., 2nd ed., 1992).
D.E. Dobbs and R. Hanks, A Modern Course on the Theory of Equations (Polygonal Publ. House, Passic, NJ, 1980).
D.S. Drucker, A second look at Descartes' rule of signs, Math. Mag. 52 (1979) 237--238.
D.K. Dunaway, A composite algorithm for finding zeros of real polynomials, Ph.D. Thesis, Southern Methodist Univ., Dallas, TX, 1972.
D.K. Dunaway, Calculation of zeroes of a real polynomial through factorization using Euclid's algorithm, SIAM J. Numer. Anal. 11 (1974) 1087--1104.
C.V. Durell and A. Robson, Advanced Algebra, Vols. 1, 2 (Bell, London, 1936--1937).
R. Dussaud, Sur les critères de stabilité des racines d'une équation algébrique, C.R. Acad. Sci. Paris 260 (1965) 4140--4142.
R. Dussaud, Sur les singularités relatives à la méthode de Bairstow classique ou généralisée, C.R. Acad. Sci. Paris 260 (1965) 5449--5452.
W. Eberly, Very fast parallel matrix and polynomial arithmetic, in: Proc. 25th Annual IEEE Symp. on Foundations of Computer Science (1984) 21--30.
E. Emre and L.M. Silverman, New criteria and system theoretic interpretations for relatively prime polynomial matrices, IEEE Trans. Automat. Control 22 (1977) 239--242.
E. Emre, The polynomial equation QQc+RPc=φ with application to dynamic feedback, SIAM J. Control Optim. 18 (1980) 611--620.
M.P. Epstein, The use of resultants to locate extreme values of polynomials, SIAM J. Appl. Math. 16 (1968) 62--70.
H. Eves, An Introduction to the History of Mathematics (Saunders, 5th ed., 1983).
J. Feinstein and Y. Bar-Ness, On the uniqueness of the minimal solution to the matrix polynomial equation A(λ)X(λ)+ Y(λ)B(λ)=C(λ), J. Franklin Inst. 310 (1980) 131--134.
H. Fine, College Algebra (Dover, New York, 1961) 304--307; 425--492.
J.B.J. Fourier, Analyse des Équations Détermines (Didot, Paris, 1831).
T.C. Fry, Some numerical methods for locating roots of polynomials, Quart. Appl. Math. 3 (1945) 89--105.
P.A. Fuhrmann, Algebraic systems theory: an analyst's point of view, J. Franklin Inst. 301 (1976) 521--540.
P.A. Fuhrmann, Polynomial models and stability criteria, in: D. Henrichsen and A. Isodori, Eds., Feedback Control of Linear and Nonlinear Systems (Springer, New York, 1982) 78--90.
A.T. Fuller, Ed., Stability of Motion (Taylor and Francis, London, 1975) 9--17.
A.T. Fuller, On redundance in aperiodicity criteria, J. Math. Anal. Appl. 68 (1979) 371--394.
H. Górecki and M. Szymkat, Application of an elimination method to the study of the geometry of zeros of polynomials, Internat. J. Control 38 (1983) 1--26.
F.R. Gantmacher, Theory of Matrices, 2 (Chelsea, New York, 1959) 172--250.
G. Gascheau, Application du théorème de M. Sturm aux transformées des équations binômes, J. Math. Pures Appl. (1) 7 (1842) 126--133.
H.U. Gerber, Wronski's formula and the resultant of two polynomials, Amer. Math. Monthly 91 (1984) 644--646.
P. Gilbert, Note sur les fonctions de Sturm, C.R. Acad. Sci. Paris 62 (1866) 338--340; also: Nouv. Ann. Math. Ser. 2 5 (1866) 263--266.
F. Giudiche, Un'osservazione sul teorema di Budan--Fourier, Giorn. Mat. 50 (1912) 188--190.
H.J. Godwin, Explicit expressions for Sturm sequences, Math. Proc. Cambridge Philos. Soc. 100 (1986) 225--227.
I. Gohberg and G. Heinig, The resultant matrix and its generalizations, I. The resultant operator for matrix polynomials, Acta Sci. Math. (Szeged) 37 (1975) 41--61.
I. Gohberg, P. Lancaster and L. Rodman, Spectral analysis of matrix polynomials, Linear Algebra Appl. 20 (1978) 1--44.
I.C. Gohberg and L.E. Lerer, Resultants of matrix polynomials, Bull. Amer. Math. Soc. 82 (1976) 565--567.
L.W. Griffiths, Introduction to the Theory of Equations (Wiley, New York, 1945).
M.L. Griss, Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD, IEEE Trans. Comput. 27 (1978) 945--950.
C.F. Gummer, The relative distribution of the real roots of a system of polynomials, Trans. Amer. Math. Soc. 23 (1922) 265--282.
W. Habicht, Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens, Comment. Math. Helv. 21 (1948) 99--116.
H.S. Hall and S.R. Knight, Higher Algebra (Macmillan, London, 1960) 83--96; 452--489.
K. Hattendorf, Bemerkung zu dem Sturmschen Satze, Nachr. Ges. Wiss. Göttingen (1873) 779--784.
G.E. Hayton, The generalized resultant matrix, Internat. J. Control 32 (1980) 567--579.
H. Heilermann, Independente Berechnung der Sturm'schen Reste, J. Reine Angew. Math. 48 (1854) 190--206.
H. Heilermann, Über die Reste welche bei der Anwendung des Sturmschen Satzes vorkommen, J. Reine Angew. Math. 43 (1852) 43--59.
L.E. Heindel, Integer arithmetic algorithms for polynomial real zero determination, in: Proc. Second Symposium on Symbolic and Algebraic Computation (1971) 415--426.
L.E. Heindel, Integer arithmetic algorithms for polynomial real zero determination, J. Assoc. Comput. Mach. 18 (1971) 533--548.
W. Heinz, Ein Verfahren zur Bestimmung der isolierten Nullstellen von Polynomen in z und z*, Math. Nachr. 65 (1972) 219--222.
P. Henrici, Applied and Computational Complex Analysis, Vol. I (Wiley, New York, 1974) 433--552.
C. Hermite, Sur le nombres des racines d'une équation algébrique comprisé entre des limites donnés, J. Reine Angew. Math. 52 (1856) 39--51; also: Oeuvres, Vol. I (Gauthier-Villars, Paris, 1905) 397--414; English translation: P.C. Parks, Internat. J. Control 26 (1977) 183--195.
C. Hermite, Sur l'indice des fractions rationelles, in: Oeuvres, Vol. III (Gauthier-Villars, Paris, 1905) 509--512.
C. Hermite, Remarques sur le théorème de M. Sturm, C.R. Acad. Sci. Paris 36 (1853) 294--297.
U. Hochstrasser, Numerical methods for finding solutions of nonlinear equations, in: J. Todd, Ed., Survey of Numerical Analysis (McGraw-Hill, New York, 1962) 255--278.
A.S. Householder, The Numerical Treatment of a Single Nonlinear Equation (McGraw-Hill, New York, 1970).
A.S. Householder, Principles of Numerical Analysis (McGraw-Hill, New York, 1953) 86--132.
A.S. Householder and G.W. Stewart III, Bigradients, Hankel determinants, and the Padé table, in: B. Dejon and P. Henrici, Eds., Constructive Aspects of the Fundamental Theorem of Algebra (Wiley/Interscience, New York, 1969) 131--150.
A.S. Householder, Bigradients and the Euclid--Sturm algorithm, SIAM Rev. 16 (1974) 207--213.
A.S. Householder, Bezoutiants, elimination and localization, SIAM Rev. 12 (1970) 73--78.
M. Housel, Note sur la semplification et la vérification relative au théorème de Sturm, Nouv. Ann. Math. Ser. 2 6 (1867) 351--354.
A. Hurwitz, Über ein Satz von Budan--Fourier, Math. Ann. 71 (1912) 584--591.
D. Ierardi and D. Kozen, Parallel Resultant Computation, in: John H. Reif, Ed., Synthesis of Parallel Algorithms (M. Kaufman, 1993) 679--720.
E. Isaacson and H.B. Keller, Analysis of Numerical Methods (Wiley, New York, 1966) 85--133.
C.G.J. Jacobi, De eliminatione variabilis e duabus aequationibus algebraicis, J. Reine Angew. Math. 15 (1836) 101--124.
N. Jacobson, Basic Algebra I (Freeman, New York, 2nd ed., 1985) 204--325.
V. Janni, Sul teorema di Sturm, Giorn. Mat. 20 (1882) 166--167.
W. Jarominek, General system of discriminants for characteristic equations, Arch. Automat. Telemech. 15 (1970) 383--402.
J. Jezek, New algorithms for minimal solution of linear polynomial equations, Kybernetika (Prague) 18 (1982) 505--516.
F. Joachimsthal, Bemerkungen über den Sturmschen Satz, J. Reine Angew. Math. 48 (1854) 386--416.
B. Jones, A heuristic for root isolation, Internat. J. Numer. Methods Engrg. 11 (1977) 598--603.
B. Jones, M. Banerjee and L. Jones, Root isolation for transcendental equations, Comput. J. 27 (1984) 184--187.
B. Jones, W.G. Waller and A. Feldman, Root isolation using function values, BIT 18 (1978) 311--319.
E.I. Jury, The theory and applications of the inners, Proc. IEEE 63 (1975) 1044--1068.
R.E. Kalman, Some computational problems and methods related to invariant factors and control theory, in: J. Leech, Ed., Computational Problems in Abstract Algebra (Pergamon, London, 1970) 393--398.
E. Kaltofen, Computer algebra algorithms, in Annual Review of Computer Science 2 (1987) 91--118.
O.J. Karetnyi and O.N. Kazmin, Identification of the domain of exponential stability in the parameter plane, Izv. Vyssh. Uchebn. Zaved. Elektromekh. (1972) 1260.
O.D. Kellogg, A necessary condition that all the roots of an algebraic equation be real, Ann. of Math. (2) 9 (1907--1908) 97--98.
H. Kempfert, On sign determinations in real algebraic number fields, Numer. Math. 11 (1968) 170--174.
E.C. Kennedy, Concerning nearly equal roots, Amer. Math. Monthly 48 (1941) 42--43.
D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Vol. II (Addison-Wesley, Reading, MA, 1969) 363--443; (2nd ed., 1981) 399--505.
M. Koralek, Formules des fonctions de M. Sturm pour les équations de 2°, 3°, et 4° degré, Nouv. Ann. Math. 11 (1852) 333--335.
D.C. Kozen, The Design and Analysis of Algorithms (Springer, Berlin, 1991) 181--185.
M.G. Krein and M.A. Neimark, The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations, Linear and Multilinear Algebra 10 (1981) 265--308.
E.V. Krishnamurthy and H. Venkateswaran, Erratum: A parallel Wilf algorithm for complex zeros of a polynomial, BIT 21 (1981) 528.
E.V. Krishnamurthy and H. Venkateswaran, A parallel Wilf algorithm for complex zeros of a polynomial, BIT 21 (1981) 104--111.
L. Kronecker, Über Sturmsche Functionen-Systeme, Mon. Kgl. Preuss. Akad. Wiss. Berlin (1878) 95--121.
L. Kronecker, Über die Charakteristik von Functionen Systemen, Mon. Kgl. Preuss. Akad. Wiss. Berlin (1878) 145--152.
L. Kronecker, Sur le théorème de Sturm, C.R. Acad. Sci. Paris 68 (1869) 1078--1082.
L. Kronecker, Über die verschiedenen Sturmschen Reihen und ihre gegenseitigen Beziehungen, Mon. Kgl. Preuss. Akad. Wiss. Berlin (1873) 117--154.
L. Kronecker, Zur Theorie der Elimination einer Variabeln aus zwei algebraischen Gleichungen, Mon. Kgl. Preuss. Akad. Wiss. Ber. (1881) 535--600.
S.Y. Ku and R.J. Adler, Computing polynomial resultants: Bezout's determinant vs. Collins' reduced p.r.s. algorithm, Comm. ACM 12 (1969) 22--30.
S.Y. Kung, T. Kailath and M. Morf, A generalized resultant matrix for polynomial matrices, in: Proc. IEEE Conf. on Decision and Control, FL (1976) 892--895.
J.L. Lagrange, De la résolution des équations numériques de tous les degrés, in: Oeuvres, Vol. 8 (Gauthier-Villars, Paris, 1879).
E. Laguerre, Sur la résolution des équations numériques, Nouv. Ann. Math. Ser. 2 17 (1878) 20--25; 97--104; also: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 52--63.
E. Laguerre, Sur quelques points de la théorie des équations numériques, in: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 184--206.
E. Laguerre, Mémoire sur la théorie des équations numériques, J. Math. Pures Appl. (3) 9 (1883) 99--146; also: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 3--47.
E. Laguerre, Sur la détermination d'une limite supérieure des racines d'une équation et sur la séparation des racines, Nouv. Ann. Math. Ser. 2 19 (1880) 47--57; 97--105; also: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 72--86.
E.N. Laguerre, Remarques sur quelques points de la théorie des équations numériques, in: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 64--66.
E.N. Laguerre, Sur la règle des signes de Descartes, in: Oeuvres, Vol. 1 (Gauthier-Villars, Paris, 1898) 67--71.
M.A. Laidacker, Another theorem relating Sylvester's matrix and the greatest common divisor, Math. Mag. 42 (1969) 126--128.
L.J. Lange, Continued fraction applications to zero location, in: Analytic Theory of Continued Fractions II, Lecture Notes in Math. 1199 (Springer, New York, 1986) 220--262.
L. Langemyr and S. McCallum, The computation of polynomial greatest common divisors over an algebraic number field, J. Symb. Comput. 8 (1989) 429--448.
H. Laurent, Usage des formes quadratiques dans la théorie des équations, Nouv. Ann. Math. Ser. 4 1 (1901) 313--319.
A.K. Lenstra, Factorisatie van polynomen, Studieweek Getaltheorie en Computers, Mathematisch Centrum, Amsterdam (1980) 95--134.
D.E. Littlewood, Skeleton Key of Mathematics (Hutchinson, London, 1960).
R.W. Liu and G.E. Seguin, Relative primeness of two polynomials, IEEE Trans. Circuits and Systems 22 (1975) 474--475.
R. Loos, Generalized polynomial remainder sequences, in: B. Buchberger, G.E. Collins and R. Loos, Eds., Computer Algebra: Symbolic and Algebraic Computations (Computing Supp.), Vol. 4 (Springer, New York, 1982) 115--137.
R. Loos, Computing in algebraic extensions, in: B. Buchberger, G.E. Collins and R. Loos, Eds., Computer Algebra: Symbolic and Algebraic Computation (Springer, New York, 1982) 173--188.
W.V. Lovitt, Elementary Theory of Equations (Prentice-Hall, New York, 1939).
K. Ma and J. von zur Gathen, Analysis of Euclidean algorithms for polynomials over finite fields, J. Symb. Comput. 9 (1990) 429--455.
C.C. MacDuffee, Theory of Equations (Wiley, New York, 1954) Chapter 7.
C.C. MacDuffee, Some applications of matrices in the theory of equations, Amer. Math. Monthly 57 (1950) 154--161.
C. Maclaurin, A Treatise of Algebra (Millar, London, 1748) 275--296.
G. Magnosi, Teorema di Sturm e sue extensione, Rend. Circ. Palermo 49 (1925) 1--159.
J. Maroulas and S. Barnett, Further results on the qualitative theory of generalized polynomials, J. Inst. Math. Appl. 23 (1979) 33--42.
J. Maroulas and S. Barnett, Polynomials with respect to a general basis, Part I, Theory, J. Math. Anal. Appl. 72 (1979) 177--194; Part II, Applications, ibid., 599--614.
J. Maroulas and D. Dascalopoulos, Applications of the generalized Sylvester matrix, Appl. Math. Comput. 8 (1981) 121--135.
J. Maroulas and S. Barnett, Continued-fraction expansions for ratios of generalized polynomials, Appl. Math. Comput. 6 (1980) 229--249.
J. Maroulas and S. Barnett, Some new results on the qualitative theory of generalized polynomials, J. Inst. Math. Appl. 22 (1978) 53--70.
R.J. McEliece and J.B. Shearer, A property of Euclid's algorithm and an application to Padé approximation, SIAM J. Appl. Math. 34 (1978) 611--615.
G. Mignosi, Teorema di Sturm e sue estensione, Rend. Circ. Mat. Palermo 49 (1925) 1--164.
M. Mignotte, Mathematics for Computer Algebra (Springer, New York, 1992).
?. Mineur, Techniques de Calcul Numérique (Paris, 1952) 555--556.
A. Miola and D.Y.Y. Yun, The computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms, ACM SIGSAM Bull. 31 (1974) 46--54.
A.P. Mishina and I.V. Proskuryakov, Higher Algebra: Linear Algebra, Polynomials and General Algebra (Pergamon, Oxford, 1965).
R. Moenck, Fast computation of GCD's, in: Proc. 5th Annual ACM Symp. on Theory of Computing (1973) 142--151.
J. Molk, Sur une notion qui comprend celle de la divisibilité et sur la théorie générale de l'élimination, Acta Math. 6 (1885) 1--166.
P.M.A. Moore and A.C. Norman, Implementing a polynomial factorization problem, in: P.S. Wang, Ed., Proc. Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1981) 109--116.
J. Moses and D.Y.Y. Yun, The EZ GCD algorithm, in: Proc. ACM Annual Conf. (1973) 159--166.
H. Mourges, Note sur le théorème de Sturm, Nouv. Ann. Math. 9 (1850) 278--279.
T. Muir, Theory of Determinants in the Historical Order of Developement, 3 (Macmillan, London, 1920) 329--342.
I. Murase and A. Pederson, A refinement of Descartes' rule of sign, Amer. Math. Monthly 98 (1991) 862--865.
E. Netto, Vorlesungen über Algebra (Teubner, Leipzig, 1896).
E. Netto, Zur Theorie der Resultanten, J. Reine Angew. Math. 116 (1896) 33--49; 117 (1897) 57--71.
I. Newton, Waste-book (manuscript notes) (c. 1665); in: Mathematical Papers of Isaac Newton, 1 (Cambridge Univ. Press, London, 1967) 520--531.
I. Newton, Arithmetica Universalis (Cambridge, 1707); translation: Universal Arithmetic (Senex, London, 1728); reprinted: Mathematical Works of Isaac Newton (Johnson, New York, 1967).
I. Newton, Lecture Notes (1683); How are equations to be resolved, in: Mathematical Papers of Isaac Newton, 5 (Cambridge Univ. Press, London, 1973) 337--423.
O. Niccoletti, Su alcune applicazioni del teorema di Sturm, Atti Accad. Sci. Torino 33 (1903--1904) 455--482.
H.A. Nour-Eldin, Ein neues Stabilitäts-Kriterium für abgetastete Regelsysteme, Regelungstechnik 19 (7) (1971) 301--307.
H.A. Nour-Eldin, A new stability criterion for linear stationary sampled-data systems, Sci. Electr. 15 (1969) 45--56.
N. Obreschkoff, Sur un problème de Laguerre, C.R. Acad. Sci. Paris 177 (1923) 102--103.
N. Obreschkoff, Sur les zéros réelles des polynômes, Mathematica 10 (1935) 132--136.
A.M. Ostrowski, Sur une règle de Laguerre, Ann. Mat. Pura Appl. (4) 31 (1950) 65--68.
A.M. Ostrowski, On Descartes rule of signs for certain polynomial developments, J. Math. Mech. 14 (1965) 195--209.
A.M. Ostrowski, On Runge's general rule of signs, Ann. Acad. Sci. Fenn. Ser. A I Math. (1964) 342.
A.M. Ostrowski, Sur l'analogue du théorème de Budan--Fourier pour les suites générales des polynômes, J. Math. Pures Appl. 43 (1964) 49--58.
J.-P. Duport and R. Dussaud, Sur une méthode de calcul sur machine de la décomposition en facteurs des polynômes sur les nombres rationnels, C.R. Acad. Sci. Paris A--B 267 (1968) A111--A113.
I.S. Pace and S. Barnett, Comparison of algorithms for g.c.d. of polynomials, Internat. J. Systems Sci. 4 (1973) 211--226.
I.S. Pace and S. Barnett, Numerical comparison of root-location algorithms for constant linear systems, in: IMA Conf. on Recent Mathematical Developments in Control, Bath (1972) 373--392.
I.S. Pace and S. Barnett, Efficient algorithms for linear system design. I, Smith form and common divisor of polynomial matrices, Internat. J. Systems Sci. 5 (1974) 403--411.
V. Pan, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, Comput. Math. Appl. 17 (1989) 1475--1480.
V.Y. Pan, New resultant inequalities and complex polynomial factorization, SIAM J. Comput. 23 (1994) 934--950.
R. Pavelle, M. Rothstein and J. Fitch, Computer algebra, Scientific American 245 (6) (1981) 136--152.
A.E. Pellet, Questions, Nouv. Ann. Math. Ser. 2 7 (1868) 334--335.
B.R. Peskin and D.R. Richman, A method to compute minimum polynomials, SIAM J. Algebraic Discrete Methods 6 (1985) 292--299.
G. Peters and J.H. Wilkinson, Eigenvalues of Ax = λBx with band-symmetric A and B, Comput. J. 12 (1969) 398--404.
K. Petr, Eine Bemerkung über die Sturmschen Functionen, Casopis Pest. Mat. Fys. 36 (1907) 136--141.
J.R. Pinkert, An exact method of finding the roots of a complex polynomial, ACM Trans. Math. Software 2 (1967) 351--363.
D.A. Plaisted, Some polynomial and integer divisibility problems are NP-hard, SIAM J. Comput. 7 (1978) 458--464.
H. Poincaré, Sur les équations algébriques, C.R. Acad. Sci. Paris 97 (1883) 1418--1419.
G. Polya and G. Szegö, Problems and Theorems in Analysis, Vol. I, translation: D. Aeppli (Springer, Berlin, 1972) 105--109; Vol. II, translation: C.E. Billigheimer (1976) 212--251; 319--329.
A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis (McGraw-Hill, New York, 2nd ed., 1987) 354.
G.W. Reitwiesner, Integer arithmetic determination of polynomial real roots, J. Res. Nat. Bur. Standards Sect. B 78 (1974) 39--43.
H.H. Rosenbrock, Generalized resultants, Electron. Lett. 4 (1968) 250--251.
H.H. Rosenbrock, Some properties of relatively prime polynomial matrices, Electron. Lett. 4 (1968) 374--375.
H.H. Rosenbrock, Relatively prime polynomial matrices, Electron. Lett. 4 (1968) 227--228.
M. Rothstein, On pseudo-resultants, in: J. Fitch, Ed., EUROSAM 84, Lecture Notes in Comput. Sci. 174 (Springer, New York, 1984) 387--396.
A. Rowe, The generalized resultant matrix, J. Inst. Math. Appl. 9 (1972) 390--396.
S.M. Rump, Real root isolation for algebraic polynomials, SIGSAM Bull. 11 (2) (1977) 2--3.
C. Runge, Separation und Approximation der Wurzeln, in: Encyklopädie der Mathematischen Wissenschaften, I, 1 (Teubner, Leipzig, 1898) 404--448.
C. Runge, Praxis der Gleichungen (De Gruyter, Berlin, 1921).
G. Salmon, Lessons Introductory to the Modern Higher Algebra (Chelsea, New York, 1964).
T. Sasaki and M. Sasaki, Analysis of accuracy decreasing in polynomial remainder sequence with floating point number coefficients, J. Inform. Process. 12 (1989) 394--403.
A. Schönhage, Assymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients, in: Proc. EUROCAM '82 (European Computer Algebra Conference) (Springer, Berlin, 1982) 3--15.
A. Schönhage, Quasi-gcd computations, J. Complexity 1 (1985) 118--137.
C.W. Schelin, Counting zeros of real polynomials within the unit disk, SIAM J. Numer. Anal. 20 (5) (1983) 1023--1031.
C. Schmidt, Über die obere Grenze für die Anzahl der positiven und negativen Wurzeln einer algebraischen Gleichung, Arch. Math. Phys. 15 (1909) 161--164.
I.J. Schoenberg, Extensions of the theorems of Descartes and Laguerre to the complex domain, Duke Math. J. 2 (1936) 84--94.
H. Schramm, Les invariants et les covariants en qualité de critères pour les racines d'une équation, Ann. Mat. Pura Appl. (2) 1 (1867--1868) 259--279.
J.T. Schwartz, Fast probabilistic algorithms for the verification of polynomial identities, J. Assoc. Comput. Mach. 27 (1980) 701--717.
J.T. Schwartz, Probabilistic algorithms for the verification of polynomial identities, in: E.W. Ng, Ed., Symbolic and Algebraic Computation: Proc. Eurosam Symp., Marseille, 1979, Lecture Notes in Comput. Sci. 72 (Springer, New York, 1979) 216--226.
H.R. Schwarz, Ein Verfahren zur Stabilitätsfrage bei Matrizen-Eigenwertproblemen, Z. Angew. Math. Phys. 7 (1956) 473--500.
J.R. Sendra, Hankel matrices and computer algebra, SIGSAM Bull. 24 (3) (1990) 17--26.
D.D. Siljak, Algebraic criterion for absolute stability, optimality and passivity of dynamic systems, Proc. Inst. Electr. Engrs. 117 (1970) 2033--2036.
L.M. Silverman and P. Van Dooren, A system theoretic interpretation for g.c.d. extraction, IEEE Trans. Automat. Control 26 (1981) 1273--1276.
J. Sommer, Über die lineare Differentialgleichung für gekoppelte elektrische Schwingungen und die Wurzeln der Gleichung vierten Grades, Ann. Phys. (4) 58 (1919) 375--392.
E. Steinitz, Algebraischen Theorie der Körper, J. Reine Angew. Math. 137 (1910) 167--309.
S. Stevin, in: A. Girard, Ed., Les Oeuvres Mathématiques de Simon Stevin, 1 (Leyden, 1634) 56.
J. Stoer and R. Bulirsch, Introduction to Numerical Analysis (Springer, New York, 1980) 270--299.
V. Strassen, The computational complexity of continued fractions, SIAM J. Comput. 12 (1983) 1--27.
D.J. Struik, Ed., A Source Book in Mathematics, 1200--1800 (Harvard Univ. Press, Cambridge, MA, 1969).
C. Sturm, Note de M. Sturm, à l'occasion de l'article précédent, J. Math. Pures Appl. 7 (1842) 132--133.
C. Sturm, Autres démonstrations de même théorème, J. Math. Pures Appl. 1 (1836) 290--308.
C. Sturm and Liouville, Démonstration d'un théorème de M. Cauchy relative aux racines imaginaires des équations, J. Math. Pures Appl. 1 (1836) 278--289.
C. Sturm, Mémoire sur la résolution des equations numériques, Mém. Savants Étrangers 6 (1835) 271--318.
J.J. Sylvester, Théorème sur limite du nombre des racines réelles d'une classe d'équations algébriques, in: Mathematical Papers of J.J. Sylvester, 2 (Cambridge University Press, London, 1908) 360.
J.J. Sylvester, On an improved form of statement of the new rule for the separation of the roots of an algebraical equation, with a postscript containing a new theorem, Philos. Mag. Ser. 4 31 (1866) 214--218.
J.J. Sylvester, On rational derivation from equations of coexistence, that is to say, a new and extended theory of elimination, Philos. Mag. Ser. 3 15 (1839) 428--435.
J.J. Sylvester, On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm's functions, and that of the greatest algebraical common measure, Philos. Trans. Roy. Soc. London 143 (1853) 407--548.
J.J. Sylvester, A method of determining by mere inspection the derivatives from two equations of any degree, Philos. Mag. Ser. 3 16 (1840) 132--135; also: in: Mathematical Papers of J.J. Sylvester, 1 (Cambridge Univ. Press, London, 1904) 54--57.
J.J. Sylvester, Observations sur un article de M. Poulain, in: Mathematical Papers of J.J. Sylvester, 2 (Cambridge University Press, London, 1908) 514--516.
J.J. Sylvester, On a remarkable modification of Sturm's theorem, Philos. Mag. Ser. 4 5 (1853) 446--456.
M.-T. Noda and T. Sasaki, Approximate GCD and its application to ill-conditioned algebraic equations, J. Comput. Appl. Math. 38 (1991) 335--351.
I. Tang, Detecting multiple roots of a polynomial, Z. Angew. Math. Mech. 55 (1975) 449--451.
Terquem, Théorème de Sturm, Nouv. Ann. Math. 2 (1843) 97.
J.M. Thomas, Theory of Equations (McGraw-Hill, New York, 1938).
I. Todhunter, Theory of Equations (Macmillan, London, 1882).
B. Trager, Algebraic factoring and rational function integration, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (Assoc. Computing Machinery, New York, 1976) 219--226.
B.M. Trager and P.S.-H. Wang, New algorithms for polynomial square-free decomposition over the integers, SIAM J. Comput. 8 (1979) 300--305.
N. Trudi, Sul processo del massimo comune divisore delle funzione intere, Giorn. Mat. 2 (1864) 21--26.
N. Trudi, Una dimostrazione del teorema di Sturm, Giorn. Mat. 1 (1863) 59--63.
H.W. Turnbull, Theory of Equations (Oliver and Boyd, Edinburgh, 1939) 72.
G. Usai, Sopra una determinazione de funzione di Sturm dovuta al Mollame, Giorn. Mat. 61 (1923) 77--91.
J.V. Uspensky, Theory of Equations (McGraw-Hill, New York, 1948).
K.Th. Vahlen, Wurzelabzählung bei Stabilitätsfragen, Z. Angew. Math. Mech. 14 (1934) 65--70.
B.L. Van der Waerden, Algebra I (Springer, Berlin, 1960); English translation: F. Blum (Ungar, New York, 1953).
E.B. Van Vleck, On the determination of a series of Sturm's functions by the calculation of a single determinant, Ann. of Math. (2) 1 (1899--1900) 1--13.
H. Van de Vel, A note on the automatic pretreatment of polynomials, Comput. J. 13 (1970) 289--290.
A.I.G. Vardoulakis and P.N.R. Stoyle, Generalized resultant theorem, J. Inst. Math. Appl. 22 (1978) 331--335.
W.G. Vogt and N.K. Bose, A method to determine whether two polynomials are relatively prime, IEEE Trans. Automat. Control 15 (1970) 379--380.
J. von zur Gathen, Parallel arithmetic computations: a survey, in: J. Gruska et al., Ed., Mathematical Foundations of Computer Science (Springer, New York, 1986) 93--112.
J. Von zur Gathen, Parallel algorithms for algebraic problems, in: 15th ACM Symp. on Theory of Computing (1983) 17--23; also: SIAM J. Comput. 13 (1984) 802--824.
M. Voorhoeve, A generalization of Descartes' rule , J. London Math. Soc. (2) 20 (1979) 446--456.
H.S. Wall, Analytic Theory of Continued Fractions (New York, 1948) 174--191.
P.S. Wang and B.M. Trager, New algorithms for polynomial square-free decomposition over the integers, SIAM J. Comput. 8 (1979) 300--305.
E. Waring, Meditationes Algebraicae (Cambridge Univ. Press, Cambridge, 1770) 54--77.
H. Weber, Traité d'Algèbra Supérieure (Gauthier-Villars, Paris, 1898).
H. Weber, Lehrbuch der Algebra (Chelsea, New York).
D. Weinberg and C. Martin, A note on resultants, Appl. Math. Comput. 24 (1987) 303--309.
L.O. Weisner, Introduction to the Theory of Equations (Macmillan, New York, 1938).
H. Wendlandt, Die Sturmschen Functionen zweiter Gattung, Arch. Math. Phys. 62 (1878) 1--177.
H.S. Wilf, Mathematics for the Physical Sciences (Wiley, New York, 1962) 82--107.
H.S. Wilf, A global bisection algorithm for computing the zeros of polynomials in the complex plane, J. Assoc. Comput. Mach. 25 (1979) 415--420.
F.A. Willers, Practical Analysis (Dover, New York, 1948) 205--265.
H.K. Wimmer, On the history of the Bezoutian and the resultant matrix, Linear Algebra Appl. 128 (1990) 27--34.
J.E. Wright, Note on the practical application of Sturm's theorem, Bull. Amer. Math. Soc. 12 (1906) 346--347.
D.Y.Y. Yun, Algebraic algorithms using p-adic constructions, in: R.D. Jenks, Ed., Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation (1976) 248--259.
D.Y.Y. Yun, On the equivalence of polynomial GCD and squarefree factorization problems, in: Proc. 1977 MACSYMA Users Conf., NASA (1977) 65--70.
R.E. Zippel, Probabilistic algorithms for sparse polynomials, in: E.W. Ng, Ed., Symbolic and Algebraic Computation (Springer, Heidelberg, 1979) 216--226.