Computer Algebra

[1]  Stephen Wolfram.  Symbolic mathematical computation , 1985, CACM.

[2]  Peter J. Weinberger.  Finding the Number of Factors of a Polynomial , 1984, J. Algorithms.

[3]  Rüdiger Loos.  Computing Rational Zeros of Integral Polynomials by p-adic Expansion , 1983, SIAM J. Comput..

[4]  A. Odlyzko,et al.  Irreducibility testing and factorization of polynomials , 1983 .

[5]  J. Smit,et al.  Symbolic Numeric Methods in Microwave Technology , 1982, EUROCAM.

[6]  Jacques Calmet,et al.  Deterministic Versus Probabilistic Factorization of Integral Polynomials , 1982, EUROCAM.

[7]  David G. Cantor,et al.  Irreducible Polynomials with Integral Coefficients Have Succinct Certificates , 1981, J. Algorithms.

[8]  Ben J. A. Hulshof,et al.  NETFORM and code optimizer manual , 1981, SIGS.

[9]  Barry M. Trager,et al.  A language for computational algebra , 1981, SYMSAC '81.

[10]  Louis B. Rall,et al.  Automatic Differentiation: Techniques and Applications , 1981, Lecture Notes in Computer Science.

[11]  J. A. van Hulzen.  Breuer's grow factor algorithm in computer algebra , 1981, SYMSACC.

[12]  Stephen Wolfram,et al.  SMP - A Symbolic Manipulation Program , 1981, SYMSAC '81.

[13]  James H. Davenport,et al.  Factorization over finitely generated fields , 1981, SYMSAC '81.

[14]  J. Smit,et al.  A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations , 1981, SYMSAC '81.

[15]  A. C. Norman,et al.  Implementing a polynomial factorization and GCD package , 1981, SYMSAC '81.

[16]  Volker Strassen,et al.  The computational complexity of continued fractions , 1981, SYMSAC '81.

[17]  Douglas H. Lanam.  An algebraic front-end for the production and use of numeric programs , 1981, SYMSAC '81.

[18]  Jan E. Åman,et al.  An algorithmic classification of geometries in general relativity , 1981, SYMSAC '81.

[19]  John J. Cannon.  The basis of a computer system for modern algebra , 1981, SYMSAC '81.

[20]  Joel Moses.  Algebraic computation for the masses , 1981, SYMSAC '81.

[21]  Richard Zippel.  Newton's iteration and the sparse Hensel algorithm (Extended Abstract) , 1981, SYMSAC '81.

[22]  Richard J. Fateman,et al.  Characterization of VAX Macsyma , 1981, SYMSAC '81.

[23]  Shunro Watanabe,et al.  A technique for solving ordinary differential equations using Riemann's P-functions , 1981, SYMSAC '81.

[24]  Arjen K. Lenstra,et al.  Lattices and factorization of polynomials , 1981, SIGS.

[25]  Yasumasa Kanada,et al.  LISP-based "big-float" system is not slow , 1981, SIGS.

[26]  H. Lenstra,et al.  Primality testing algorithms , 1981 .

[27]  Dennis Soule Arnon.  Algorithms for the geometry of semi-algebraic sets , 1981 .

[28]  J. Hayter,et al.  An analytic structure factor for macroion solutions , 1981 .

[29]  David R. Stoutemyer.  The coming revolution in scientific computation , 1981 .

[30]  John Fitch.  User-based integration software , 1981, SYMSAC '81.

[31]  Willard L. Miranker,et al.  Computer arithmetic in theory and practice , 1981, Computer science and applied mathematics.

[32]  Jacques Calmet,et al.  An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p) , 1980, Inf. Process. Lett..

[33]  Audun Holme.  Some Computing Aspects of Projective Geometry I. Basic functions, algorithms and procedures. , 1980 .

[34]  J. A. van Hulzen.  Computational problems in producing taylor coefficients for the rotating disk problem , 1980, SIGS.

[35]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[36]  Joachim Neubüser.  Some remarks on a proposed taxonomy for algebraic computation , 1980, SIGS.

[37]  F. Estabrook.  Differential geometry as a tool for applied mathematicians , 1980 .

[38]  Guy Viry.  Factorisation des Polynomes a Plusieurs Variables , 1980, RAIRO Theor. Informatics Appl..

[39]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[40]  J. Marti,et al.  Standard LISP report , 1979, SIGP.

[41]  Paul S. Wang,et al.  New Algorithms for Polynomial Square-Free Decomposition Over the Integers , 1979, SIAM J. Comput..

[42]  B. F. Caviness,et al.  A Structure Theorem for Exponential and Primitive Functions , 1979, SIAM J. Comput..

[43]  David R. Stoutemyer.  Computer symbolic math & education: a radical proposal , 1979, SIGS.

[44]  Paul S. Wang.  Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion , 1979 .

[45]  Alfred Woll,et al.  gamma-Algebra algorithms for canonical hypercomplex representations , 1979, EUROSAM.

[46]  Anthony C. Hearn.  Non-modular computation of polynomial GCD's using trial division , 1979, EUROSAM.

[47]  Lars Hörnfeldt.  A system for automatic generation of tensor algorithms , 1979, EUROSAM.

[48]  Tateaki Sasaki.  An arbitrary precision real arithmetic package in REDUCE , 1979, EUROSAM.

[49]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[50]  Ellis Horowitz,et al.  Abstract data types and software validation , 1978, CACM.

[51]  Paul S. Wang.  An improved multivariate polynomial factoring algorithm , 1978 .

[52]  Peter Kornerup,et al.  A feasibility analysis of binary fixed-slash and floating-slash number systems , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[53]  Victor Pereyra,et al.  Symbolic generation of finite difference formulas , 1978 .

[54]  W. S. Brown.  The Subresultant PRS Algorithm , 1978, TOMS.

[55]  David R. Musser,et al.  Analysis of the Pope-Stein Division Algorithm , 1977, Information Processing Letters.

[56]  H. James Gawlik.  The further development of MIRA , 1977, SIGS.

[57]  D. Y. Y. Yun.  On the equivalence of polynomial GCD and squarefree factorization problems , 1977 .

[58]  J. Fitch.  Mechanizing the solution of perturbation problems (invited) , 1977 .

[59]  P. S. Wang.  Preserving sparseness in multivariate polynominal factorization , 1977 .

[60]  B. F. Caviness,et al.  Modular polynomial arithmetic in partial fraction decomposition , 1977 .

[61]  Peter J. Weinberger,et al.  Factoring Polynomials Over Algebraic Number Fields , 1976, TOMS.

[62]  Knut Bahr.  Basic algorithms in FORMAC: design and verification , 1976, SYMSAC '76.

[63]  Ralph Roskies,et al.  ASHMEDAI and a large algebraic problem , 1976, SYMSAC '76.

[64]  Richard J. Fateman.  The MACSYMA “big-floating-point” arithmetic system , 1976, SYMSAC '76.

[65]  Desanka Polajnar,et al.  A study of alternative methods for the symbolic calculation of elliptic integrals , 1976, SYMSAC '76.

[66]  Peter Schmidt.  Automatic symbolic solution of differential equations of first order and first degree , 1976, SYMSAC '76.

[67]  Martin L. Griss.  The definition and use of data structures in REDUCE , 1976, SYMSAC '76.

[68]  David Y. Y. Yun,et al.  On square-free decomposition algorithms , 1976, SYMSAC '76.

[69]  Anthony C. Hearn.  A new REDUCE model for algebraic simplification , 1976, SYMSAC '76.

[70]  John D. Lipson.  Newton's method: a great algebraic algorithm , 1976, SYMSAC '76.

[71]  B. F. Caviness,et al.  Algorithms for Gaussian integer arithmetic , 1976, SYMSAC '76.

[72]  Barry M. Trager,et al.  Algebraic factoring and rational function integration , 1976, SYMSAC '76.

[73]  Robert T. Moenck,et al.  Practical fast polynomial multiplication , 1976, SYMSAC '76.

[74]  Jukka Korpela.  General characteristics of the ANALITIK language , 1976, SIGS.

[75]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[76]  Rüdiger G. K. Loos,et al.  The algorithm description language ALDES (report) , 1976, SIGS.

[77]  Billy G. Claybrook.  Factorization of Multivariate Polynomials over the integers , 1976, SIGS.

[78]  David Y. Y. Yun.  HENSEL MEETS NEWTON — ALGEBRAIC CONSTRUCTIONS IN AN ANALYTIC SETTING , 1976 .

[79]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[80]  David W. Matula.  Fixed-slash and floating-slash rational arithmetic , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[81]  H. Strubbe,et al.  Solution to SIGSAM problem no. 5 using schoonschip , 1975, SIGS.

[82]  Max Engeli.  An enhanced SYMBAL system , 1975, SIGS.

[83]  Stuart I. Feldman,et al.  A brief description of Altran , 1975, SIGS.

[84]  Ellis Horowitz.  A Sorting Algorithm for Polynomial Multiplication , 1975, JACM.

[85]  Paul S. Wang,et al.  Factoring multivariate polynomials over the integers , 1973, SIGS.

[86]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[87]  Paul S. Wang,et al.  Factoring multivariate polynomials over algebraic number fields in MACSYMA , 1975, SIGS.

[88]  Richard D. Jenks.  Course outline: Yale University, New Haven , 1975, SIGS.

[89]  R. Vaughan.  Bounds for the coefficients of cyclotomic polynomials. , 1975 .

[90]  B. F. Caviness,et al.  SAM course outlines , 1975, SGCS.

[91]  N. J. A. Sloane,et al.  On the Classification and Enumeration of Self-Dual Codes , 1975, J. Comb. Theory, Ser. A.

[92]  David R. Musser,et al.  Multivariate Polynomial Factorization , 1975, JACM.

[93]  Knut Bahr.  Utilizing the FORMAC novelties , 1975, SIGS.

[94]  Bauke Hiemstra.  A pre-editor for CAMAL , 1975, SIGS.

[95]  H. T. Kung.  On computing reciprocals of power series , 1974 .

[96]  Richard J. Fateman.  Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments , 1974, SIAM J. Comput..

[97]  I. M. Willers,et al.  A new integration algorithm for ordinary differential equations based on continued fraction approximations , 1974, CACM.

[98]  Jaap Smit,et al.  Tuning an algebraic manipulation system through measurements , 1974, SIGS.

[99]  Joel Moses,et al.  MACSYMA - the fifth year , 1974, SIGS.

[100]  H. Strubbe.  Presentation of the SCHOONSCHIP system , 1974, SIGS.

[101]  Pierre Verbaeten,et al.  The automatic construction of pure recurrence relations , 1974, SIGS.

[102]  Andrew D. Hall,et al.  Factored rational expressions in ALTRAN , 1974, SIGS.

[103]  W. S. Brown.  On computing with factored rational expressions , 1974, SIGS.

[104]  Rüdiger G. K. Loos.  Toward a formal implementation of computer algebra , 1974, SIGS.

[105]  Stephen C. Johnson,et al.  Sparse polynomial arithmetic , 1974, SIGS.

[106]  Richard J. Fateman.  On the Computation of Powers of Sparse Polynomials , 1974 .

[107]  Ellis Horowitz,et al.  The minimum root separation of a polynomial , 1974 .

[108]  J. A. van Hulzen.  FORMAC today, or what can happen to an orphan , 1974, SIGS.

[109]  David R. Musser,et al.  The application of a symbolic mathematical system to program verification , 1974, ACM '74.

[110]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[111]  Michael T. McClellan,et al.  The Exact Solution of Systems of Linear Equations with Polynomial Coefficients , 1973, JACM.

[112]  David Y. Y. Yun,et al.  The EZ GCD algorithm , 1973, ACM Annual Conference.

[113]  G. E. Collins.  Computer Algebra of Polynomials and Rational Functions , 1973 .

[114]  Henry Hansen,et al.  Introduction to P-Adic Numbers and their Functions , 1973 .

[115]  James Robert Pinkert.  Algebraic algorithms for computing the complex zeros of gaussian polynomials. , 1973 .

[116]  R. Moenck.  Studies in fast algebraic algorithms. , 1973 .

[117]  David Y. Y. Yun,et al.  The Hensel Lemma in Algebraic Manipulation , 1973, Outstanding Dissertations in the Computer Sciences.

[118]  Ellis Horowitz.  The Efficient Calculation of Powers of Polynomials , 1973, J. Comput. Syst. Sci..

[119]  William Hamilton Jefferys,et al.  A precompiler for the formula manipulation system TRIGMAN , 1972 .

[120]  Rüdiger Loos.  Algebraic algorithm descriptions as programs , 1972, SIGS.

[121]  B. F. Caviness,et al.  Symbolic mathematical computation in a Ph.D. Computer Science program , 1972, SIGS.

[122]  Pierre Verbaeten,et al.  A subroutine package for polynomial manipulation , 1972 .

[123]  J. A. Campbell.  Problem #2 - the Y2n functions , 1972, SIGS.

[124]  Horst G. Zimmer,et al.  Computational problems, methods, and results in algebraic number theory , 1972 .

[125]  George E. Collins.  The SAC-1 Polynomial GCD and Resultant System , 1972 .

[126]  L. D. Neidleman.  A user's examination of the formula manipulation language - SYMBAL , 1971, SIGS.

[127]  George E. Collins,et al.  The Calculation of Multivariate Polynomial Resultants , 1971, JACM.

[128]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[129]  Andrew D. Hall,et al.  The Altran system for rational function manipulation — a survey , 1971, CACM.

[130]  Joel Moses,et al.  Algebraic simplification: a guide for the perplexed , 1971, CACM.

[131]  William H. Jefferys.  Automated algebraic manipulation in celestial mechanics , 1971, CACM.

[132]  J. Pollard,et al.  The fast Fourier transform in a finite field , 1971 .

[133]  W. Morven Gentleman,et al.  Optimal multiplication chains for computing a power of a symbolic polynomial , 1971, SIGS.

[134]  Carl Engelman.  The legacy of MATHLAB 68 , 1971, SYMSAC '71.

[135]  Joel Moses,et al.  Symbolic integration the stormy decade , 1971, SYMSAC '71.

[136]  Robert G. Tobey.  Symbolic mathematical computation—introduction and overview , 1971, SYMSAC '71.

[137]  William A. Martin,et al.  Computer input/output of mathematical expressions , 1971, SYMSAC '71.

[138]  Lee E. Heindel,et al.  Integer arithmetic algorithms for polynomial real zero determination , 1971, SYMSAC '71.

[139]  George E. Collins,et al.  The SAC-1 system: An introduction and survey , 1971, SYMSAC '71.

[140]  S. R. Bourne,et al.  The design of the Cambridge algebra system , 1971, SYMSAC '71.

[141]  A. Hearn.  Applications of symbol manipulation in theoretical physics , 1971, CACM.

[142]  J. D. Lipson,et al.  Chinese remainder and interpolation algorithms , 1971, SYMSAC '71.

[143]  Yvon Siret.  A conversational system for engineering assistance: Aladin , 1971, SYMSAC '71.

[144]  Carlos Christensen.  An introduction to AMBIT/L, a diagrammatic language for list processing , 1971, SYMSAC '71.

[145]  Anthony C. Hearn,et al.  REDUCE 2: A system and language for algebraic manipulation , 1971, SYMSAC '71.

[146]  W. S. Brown.  On Euclid's algorithm and the computation of polynomial greatest common divisors , 1971, SYMSAC '71.

[147]  Michael Karr,et al.  IAM, a system for interactive algebraic manipulation , 1971, SYMSAC '71.

[148]  Cleve B. Moler,et al.  Semi-symbolic methods in partial differential equations , 1971, SYMSAC '71.

[149]  W. A. Martin,et al.  The MACSYMA system , 1971, SYMSAC '71.

[150]  D. Musser.  Algorithms for polynomial factorization. , 1971 .

[151]  Richard D. Jenks,et al.  "META/PLUS" - The Syntax Extension Facility for "SCRATCHPAD" , 1971, IFIP Congress.

[152]  David Barton,et al.  The Automatic Solution of Systems of Ordinary Differential Equations by the Method of Taylor Series , 1971, Computer/law journal.

[153]  R. D. Jenks.  META/LISP: an interactive translator writing system , 1970, SIGS.

[154]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[155]  David Barton,et al.  The Structure of the Cambridge Algebra System , 1970, Comput. J..

[156]  Ludovít Molnár,et al.  Analytical differentiation on a digital computer , 1970, Kybernetika.

[157]  H. Zassenhaus.  On Hensel factorization, I , 1969 .

[158]  H. A. Feldman.  Some symbolic computations in finite fields , 1969 .

[159]  G. E. Collins.  Computing time analyses for some arithmetic and algebraic algorithms , 1969 .

[160]  M. E. Engeli,et al.  Formula Manipulation—The User’s Point of View , 1969 .

[161]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[162]  E. Bareiss.  Sylvester’s identity and multistep integer-preserving Gaussian elimination , 1968 .

[163]  Alston S. Householder,et al.  Bigradients and the Problem of Routh and Hurwitz , 1968 .

[164]  R. Güting,et al.  Polynomials with multiple zeros , 1967 .

[165]  A. C. Hearn,et al.  REDUCE: a user-oriented interactive system for algebraic simplification , 1967, Symposium on Interactive Systems for Experimental Applied Mathematics.

[166]  W. A. Martin,et al.  Symbolic mathematical laboratory , 1967 .

[167]  George E. Collins,et al.  Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.

[168]  R. R. Fenichel.  AN ON-LINE SYSTEM FOR ALGEBRAIC MANIPULATION , 1966 .

[169]  George E. Collins.  Polynomial Remainder Sequences and Determinants , 1966 .

[170]  Ward Douglas Maurer.  Computer experiments in finite algebra , 1966, CACM.

[171]  Robert G. Tobey.  Experience with FORMAC algorithm design , 1966, CACM.

[172]  George E. Collins.  PM, a system for polynomial manipulation , 1966, CACM.

[173]  Jean E. Sammet,et al.  Survey of formula manipulation , 1966, CACM.

[174]  Anthony C. Hearn,et al.  Computation of algebraic properties of elementary particle reactions using a digital computer , 1966, CACM.

[175]  Joel Moses,et al.  Symbolic integration: the stormy decade , 1966, CACM.

[176]  M. G. Say,et al.  Relativistic Quantum Fields , 1966 .

[177]  Alan J. Perlis,et al.  A DEFINITION OF FORMULA ALGOL. , 1966 .

[178]  R. G. Tobey,et al.  Automatic simplification in FORMAC , 1965, AFIPS '65 (Fall, part I).

[179]  W. S. Brown.  An operating environment for dynamic-recursive computer programming systems , 1965, CACM.

[180]  Kenneth Hartt.  Some Analytical Procedures for Computers and Their Applications to a Class of Multidimensional Integrals , 1964, JACM.

[181]  K. Mahler.  An inequality for the discriminant of a polynomial. , 1964 .

[182]  J. Hyde,et al.  The Alpak system for nonnumerical algebra on a digital computer — II: Rational functions of several variables and truncated power series with rational-function coefficients , 1964 .

[183]  James R. Slagle,et al.  A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus , 1963, JACM.

[184]  William S. Brown,et al.  The alpak system for nonnumerical algebra on a digital computer , 1963 .

[185]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[186]  Leland H. Williams.  Algebra of Polynomials in Several Variables for a Digital Computer , 1962, JACM.

[187]  Arnold R. M. Rom.  Manipulation of algebraic expressions , 1961, CACM.

[188]  David A. Pope,et al.  Multiple precision arithmetic , 1960, CACM.

[189]  A. O. Gelʹfond.  Transcendental and Algebraic Numbers , 1960 .

[190]  I. Kaplansky.  An introduction to differential algebra , 1957 .

[191]  Peter Henrici,et al.  Automatic Computations with Power Series , 1956, JACM.

[192]  Peter Henrici.  A Subroutine for Computations with Rational Numbers , 1956, JACM.

[193]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[194]  W. Rogosinski,et al.  The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.

[195]  Zur inhomogenen Eliminationstheorie , 1948 .

[196]  W. Habicht.  Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens , 1948 .

[197]  D. H. Lehmer.  Euclid's Algorithm for Large Numbers , 1938 .

[198]  D. Bernstein.  DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .