default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 40, 2005
Volume 40, Number 1, July 2005
- Bernhard Gramlich, Salvador Lucas
:
Reduction strategies in rewriting and programming. 745-747 - Pierre Réty, Julie Vuotto:
Tree automata for rewrite strategies. 749-794 - Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, Germán Vidal:
Operational semantics for declarative multi-paradigm languages. 795-829 - Eelco Visser:
A survey of strategies in rule-based program transformation systems. 831-873 - Sergio Antoy:
Evaluation strategies for functional logic programming. 875-903
Volume 40, Number 2, August 2005
- Manfred Schmidt-Schauß, Klaus U. Schulz:
Decidability of bounded higher-order unification. 905-954 - William Y. C. Chen, Husam L. Saad:
On the Gosper-Petkovs(ek representation of rational functions. 955-963 - Elizabeth Gasparim, Irena Swanson:
Computing instanton numbers of curve singularities. 965-978 - Sebastian Gann, Herwig Hauser:
Perfect bases for differential equations. 979-997 - Josep Àlvarez Montaner:
Operations with regular holonomic D-modules with support a normal crossing. 999-1012 - John J. Cannon, Derek F. Holt, Michael C. Slattery, Allan K. Steel:
Computing subgroups of bounded index in a finite group. 1013-1022
Volume 40, Number 3, September 2005
- Aldo Conca, Jessica Sidman:
Generic initial ideals of points and curves. 1023-1038 - Manuel García Román, Socorro García Román:
Gröbner bases and syzygies on bimodules over PBW algebras. 1039-1052 - Allan K. Steel:
Conquering inseparability: Primary decomposition and multivariate factorization over algebraic function fields of positive characteristic. 1053-1075 - Jesús Gago-Vargas, María Isabel Hartillo-Hermoso, José María Ucha-Enríquez:
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials. 1076-1086 - Anna Torstensson, Victor Ufnarovski, Hans Öfverbeck:
Using resultants for SAGBI basis verification in the univariate polynomial ring. 1087-1105 - J. D. Phillips, Petr Vojtechovský:
Linear groupoids and the associated wreath products. 1106-1125 - Christopher J. Hillar:
Erratum to "Cyclic resultants" [J. Symbolic Comput. 39 (6) (2005) 653-669]. 1126-1127
Volume 40, Number 4-5, October-November 2005
- Ilias S. Kotsireas, Alkiviadis G. Akritas, Stanly L. Steinberg, Michael J. Wester:
Foreword to the special issue on Applications of computer algebra. 1129-1130 - Joachim Apel, Ralf Hemmecke:
Detecting unnecessary reductions in an involutive basis computation. 1131-1149 - Laurent Busé, Marc Chardin:
Implicitizing rational hypersurfaces using approximation complexes. 1150-1168 - Elisabetta Fortuna, Patrizia M. Gianni, Paola Parenti:
Some constructions for real algebraic curves. 1169-1179 - Karin Gatermann, Serkan Hosten:
Computational algebra for bifurcation theory. 1180-1207 - Rocío González-Díaz, Pedro Real:
Simplification techniques for maps in simplicial topology. 1208-1224 - Nik Lygeros, Paul-Valère Marchand, Marc Massot:
Enumeration and 3D representation of the stereo-isomers of alkane molecules. 1225-1241 - Richard Moeckel:
Sturm's algorithm and isolating blocks. 1242-1255 - Jesús F. Palacián, Patricia Yanguas:
Asymptotic invariant tori of perturbed two-body problems. 1256-1268
Volume 40, Number 6, December 2005
- Björn Assmann, Bettina Eick:
Computing polycyclic presentations for polycyclic rational matrix groups. 1269-1284 - Lawrence H. Smith:
On ordering free groups. 1285-1290 - Josef Schicho, Ibolya Szilágyi:
Numerical stability of surface implicitization. 1291-1301 - Liqun Qi:
Eigenvalues of a real supersymmetric tensor. 1302-1324 - José Méndez Omaña, Michael E. Pohst:
Factoring polynomials over global fields II. 1325-1339 - Mustapha Er-Riani, Olivier Séro-Guillaume:
Shapes of liquid drops obtained using symbolic computation. 1340-1360 - Karin Gatermann, Markus Eiswirth, Anke Sensse:
Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems. 1361-1382 - K. Subramani, Dejan Desovski:
Out of order quantifier elimination for Standard Quantified Linear Programs. 1383-1396
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 2026-05-19 22:25 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:
