Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 1995: Montreal, Canada
- A. H. M. Levelt:
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC '95, Montreal, Canada, July 10-12, 1995. ACM 1995, ISBN 0-89791-699-9
Differential Equations
- Ian G. Lisle, Gregory J. Reid, A. Boulton:
Algorithmic Determination of Structure of Infinite Lie Pseudogroups of Symmetries of PDEs. 1-6 - Thomas Wolf:
Programs for Applying Symmetries. 7-15 - Fritz Schwarz:
Symmetries of 2nd and 3rd Order ODE's. 16-25 - M. J. Doffou, Robert L. Grossman:
The Symbolic Computation of Differential Invariants of Polynomial Vector Field Systems Using Trees. 26-31
Visualization
- Ron Avitzur, Olaf Bachmann, Norbert Kajler:
From Honest to Intelligent Plotting. 32-41 - Eugene V. Zima:
Simplification and Optimization Transformations of Chains of Recurrences. 42-50 - Trân Quoc Nam:
A Hybrid Symbolic-Numerical Method for Tracing Surface-to-Surface Intersections. 51-58 - Shankar Krishnan, Dinesh Manocha:
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets. 59-67
Algebraic Numbers
- Mario Daberkow, Michael Pohst:
Computations with Relative Extensions of Number Fields with an Application to the Construction of Hilbert Class Fields. 68-76 - Peter A. Broadbery, T. Gómez-Díaz, Stephen M. Watt:
On the Implementation of Dynamic Evaluation. 77-84 - Kazuhiro Yokoyama, Ziming Li, István Nemes:
Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial. 85-89 - Mark van Hoeij:
An Algorithm for Computing the Weierstrass Normal Form. 90-95
Algorithms I
- Dima Grigoriev, Yagati N. Lakshman:
Algorithms for Computing Sparse Shifts for Multivariate Polynomials. 96-103 - Daniel Richardson:
A Simplified Method of Recognizing Zero Among Elementary Constants. 104-109 - Mark Giesbrecht:
Fast Computation of the Smith Normal Form of an Integer Matrix. 110-118 - Arne Storjohann, George Labahn:
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation. 119-125
Systems
- Gene Cooperman:
STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems. 126-132 - T. H. Einwohner, Richard J. Fateman:
Searching Techniques for Integral Tables. 133-139 - Neil Soiffer:
Mathematical Typesetting in Mathematica. 140-149 - Clemens Ballarin, Karsten Homann, Jacques Calmet:
Theorems and Algorithms: An Interface between Isabelle and Maple. 150-157
Polynomial and Differential Algebra
- François Boulier, Daniel Lazard, François Ollivier, Michel Petitot:
Representation for the Radical of a Finitely Generated Differential Ideal. 158-166 - Maria Grazia Marinari, Teo Mora, H. Michael Möller:
Gröbner Duality and Multiplicities in Polynomial System Solving. 167-179 - Laureano González-Vega, Guadalupe Trujillo:
Implicitization of Parametric Curves and Surfaces by Using Symmetric Functions. 180-186 - Deepak Kapur, Tushar Saxena:
Comparison of Various Multivariate Resultant Formulations. 187-194
Seminumeral Methods
- Robert M. Corless, Patrizia M. Gianni, Barry M. Trager, Stephen M. Watt:
The Singular Value Decomposition for Polynomial Systems. 195-207 - Klaus-Dieter Semmler, Mika Seppälä:
Numerical Uniformization of Hyperelliptic Curves. 208-215 - Claudine Chaffy:
The Analytic Continuation Process: From Computer Algebra to Numerical Analysis. 216-222 - M. P. Quéré, Gilles Villard:
An Algorithm for the Reduction of Linear DAE. 223-231
Greatest Common Divisors
- Angel Díaz, Erich Kaltofen
:
On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. 232-239 - Hsin-Chao Liao, Richard J. Fateman:
Evaluation of the Heuristic Polynomial GCD. 240-247 - Bohdan S. Majewski, George Havas:
A Solution to the Extended GCD Problem. 248-253 - Jonathan Sorenson:
An Analysis of Lehmer's Euclidean GCD Algorithm. 254-258
Groups
- Gene Cooperman, Larry Finkelstein, Michael Tselman:
Computing with Matrix Groups Using Permutation Representations. 259-264 - Ferenc Rakoczi:
Fast Recognition of the Nilpotency of Permutation Groups. 265-269 - Prabhav Morje:
A Nearly Linear Algorithm for Sylow Subgroups in Small-Base Groups. 270-277 - Torsten Minkwitz:
On the Computation of Ordinary Irreducible Representations of Finite Groups. 278-284
Algorithms II
- Sergei A. Abramov:
Rational Solutions of linear Difference and q-Difference Equations with Polynomial Coefficients. 285-289 - Sergei A. Abramov, Manuel Bronstein, Marko Petkovsek:
On Polynomial Solutions of Linear Operator Equations. 290-296 - Moulay A. Barkatou:
A Rational Version of Moser's Algorithm. 297-302 - Sergei A. Abramov:
Indefinite Sums of Rational Functions. 303-308
a service of 
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 2023-03-26 23:24 CEST 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:
