default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 9, 1990
Volume 9, Number 1, January 1990
- Abdelilah Kandri-Rody, Volker Weispfenning:
Non-Commutative Gröbner Bases in Algebras of Solvable Type. 1-26 - Gilles Labonté:
An Algorithm for the Construction of Matrix Representations for Finitely Presented Non-Commutative Algebras. 27-38 - Holger W. Gollan, T. W. Ostermann:
Operation of Class Sums on Permutation Modules. 39-47 - Manuel Bronstein:
The Trascendental Risch Differential Equation. 49-60 - Hubert Caprasse:
Renormalisation Group, Function Iterations and Computer Algebra. 61-72 - Stephen A. Fulling:
The Analytic Approach to Recursion Relations. 73-85 - Man Kam Kwon, Mary Beth Dever:
Computer-Aided Study of a Problem in Hermitian Matrix Theory. 87-112
Volume 9, Number 2, February 1990
- Daniel Lazard, Renaud Rioboo:
Integration of Rational Functions: Rational Computation of the Logarithmic Part. 113-115 - Manuel Bronstein:
Integration of Elementary Functions. 177-173 - Joachim von zur Gathen:
Inversion in Finite Fields Using Logarithmic Depth. 175-183 - Alex Kean, George K. Tsiknis:
An Incremental Method for Generating Prime Implicants/Impicates. 185-206 - Moshe Eisenberger:
Application of Symbolic Algebra to the Analysis of Plates on Variable Elastic Foundation. 207-213 - Noel G. Lloyd, Jane M. Pearson:
REDUCE and the Bifurcation of Limit Cycles. 215-224
Volume 9, Number 3, March 1990
- Erich L. Kaltofen
, Bruno Buchberger:
Special Issue Computational Algebraic Complexity Editorial. 225-228 - Eric Bach, Victor Shoup:
Factoring Polynomials Using Fewer Random Bits. 229-239 - John F. Canny:
Generalised Characteristic Polynomials. 241-250 - Don Coppersmith, Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions. 251-280 - Joachim von zur Gathen:
Functional Decomposition of Polynomials: The Tame Case. 281-299 - Erich L. Kaltofen, Barry M. Trager:
Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. 301-320 - Heinrich Rolletschek:
Shortest Division Chains in Imaginary Quadratic Number Fields. 321-354 - Lajos Rónyai:
Computing the Structure of Finite Algebras. 355-373 - Richard Zippel:
Interpolating Polynomials from Their Values. 375-403
Volume 9, Number 4, April 1990
- Takis Sakkalis, Rida T. Farouki:
Singular Points of Algebraic Curves. 405-421 - Hantao Zhang:
Automated Proof of Ring Commutativity Problems by Algebraic Methods. 423-427 - Keju Ma, Joachim von zur Gathen:
Analysis of Euclidean Algorithms for Polynomials over Finite Fields. 429-455 - Oliver Günther:
Minimum K-Partitioning of Rectilinear Polygons. 457-483 - R. Ramesh, I. V. Ramakrishnan:
Parallel Tree Pattern Matching. 485-501 - Robert M. Corless, David J. Jeffrey:
Solution of a Hydrodynamic Lubrication Problem with Maple. 503-513 - Stuart B. Savage:
Symbolic Computation of the Flow of Granular Avalanches. 515-530
Volume 9, Number 5/6, May/June 1990
- S. B. Conlon:
Calculating Characters of p-Groups. 535-550 - S. B. Conlon:
Computing Modular and Projective Character Degrees of Soluble Groups. 551-570 - Gerhard O. Michler:
Some Problems in Computational Representation Theory. 571-582 - Richard A. Parker, Robert A. Wilson:
The Computer Construction of Matrix Representations of Finite Groups over Finite Fields. 583-590 - Alexander J. E. Ryba:
Computer Condensation of Modular Representations. 591-600 - Gerhard J. A. Schneider:
Dixon's Character Table Algorithm Revisited. 601-606
- Gerhard J. A. Schneider:
Computing with Endomorphism Rings of Modular Representations. 607-636 - Stephen P. Glasby, Michael C. Slattery:
Computing Intersections and Normalizers in Soluble Groups. 637-651 - George Havas, Mike F. Newman, Michael R. Vaughan-Lee:
A Nilpotent Quotient Algorithm for Graded Lie Rings. 653-664 - Charles R. Leedham-Green, Leonard H. Soicher:
Collection from the Left and Other Strategies. 665-675 - E. A. O'Brien:
The p-Group Generation Algorithm. 677-698 - Charles C. Sims:
Computing the Order of a Solvable Permutation Group. 699-705 - Charles C. Sims:
Implementing the Baumslag-Cannonito-Miller Polycyclic Quotient Algorithm. 707-723 - Michael R. Vaughan-Lee:
Collection from the Left. 725-733
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
