default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 47
Volume 47, Number 1, January 2012
- Erich L. Kaltofen
, Bin Li, Zhengfeng Yang, Lihong Zhi:
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. 1-15 - Scott McCallum, Volker Weispfenning:
Deciding polynomial-transcendental problems. 16-31 - Adrien Poteaux, Marc Rybowicz:
Good reduction of Puiseux series and applications. 32-63 - Henrik Bäärnhielm, Charles R. Leedham-Green:
The Product Replacement Prospector. 64-75 - George Bluman, Raouf Dridi:
New solutions for ordinary differential equations. 76-88 - Michael C. Harrison:
An extension of Kedlaya's algorithm for hyperelliptic curves. 89-101 - Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó:
On the computation of matrices of traces and radicals of ideals. 102-122
Volume 47, Number 2, February 2012
- Joel Moses:
Macsyma: A personal history. 123-130
- Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap:
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. 131-152 - Michael A. Burr, Felix Krahmer:
SqFreeEVAL: An (almost) optimal real-root isolation algorithm. 153-166 - Jiawang Nie:
Discriminants and nonnegative polynomials. 167-191 - Ainhoa Aparicio-Monforte, Jacques-Arthur Weil:
A reduced form for linear differential systems and its application to integrability of Hamiltonian systems. 192-213 - Rida T. Farouki, Takis Sakkalis:
A complete classification of quintic space curves with rational rotation-minimizing frames. 214-226
Volume 47, Number 3, March 2012
- Xiaoli Wu, Lihong Zhi:
Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms. 227-238 - Michael Kerber, Michael Sagraloff:
A worst-case bound for topology computation of algebraic curves. 239-258 - Vincent Vatter:
Finding regular insertion encodings for permutation classes. 259-265 - Jean Marc Couveignes, Jean-Gabriel Kammerer:
The geometry of flex tangents to a cubic curve and its parameterizations. 266-281 - Adam W. Strzebonski:
Real root isolation for exp-log-arctan functions. 282-314 - Andreas-Stephan Elsenhans:
Invariants for the computation of intransitive and transitive Galois groups. 315-326 - Juan Gerardo Alcázar:
Local shape of generalized offsets to algebraic curves. 327-341 - Jon González-Sánchez, Michael Harrison, Irene Polo-Blanco, Josef Schicho:
Algorithms for Del Pezzo surfaces of degree 5 (construction, parametrization). 342-353
Volume 47, Number 4, April 2012
- Mark Giesbrecht, Daniel Panario:
In honour of the research and influence of Joachim von zur Gathen at 60. 355-357 - San Ling, Igor E. Shparlinski, Ron Steinfeld, Huaxiong Wang:
On the modular inversion hidden number problem. 358-367 - Pierrick Gaudry, Éric Schost:
Genus 2 point counting over prime fields. 368-400 - Thomas Prest, Paul Zimmermann:
Non-linear polynomial selection for the number field sieve. 401-409 - Mohamed Elkadi, André Galligo, Thang Luu Ba:
Approximate GCD of several univariate polynomials with small degree perturbations. 410-421 - Somit Gupta, Soumojit Sarkar, Arne Storjohann, Johnny Valeriote:
Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x]. 422-453 - Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Faster p-adic feasibility for certain multivariate sparse polynomials. 454-479 - Matthew T. Comer, Erich L. Kaltofen:
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. 480-491 - Luis H. Gallardo, Olivier Rahavandrainy:
All unitary perfect polynomials over f2 with at most four distinct irreducible factors. 492-502
Volume 47, Number 5, May 2012
- Aurélien Greuet, Feng Guo, Mohab Safey El Din, Lihong Zhi:
Global optimization of polynomials restricted to a smooth variety using sums of squares. 503-518 - Torsten Sprenger, Wolfram Koepf:
Algorithmic determination of q-power series for q-holonomic functions. 519-535 - John Abbott:
Twin-float arithmetic. 536-551 - Nicole Sutherland:
Efficient computation of maximal orders in radical (including Kummer) extensions. 552-567 - Jeaman Ahn, Sijong Kwak, Yeongseok Song:
The degree complexity of smooth surfaces of codimension 2. 568-581
Volume 47, Number 6, June 2012
- Xiao-Shan Gao, Deepak Kapur:
Preface. 583-585 - Xiao-Shan Gao, Deepak Kapur:
A brief introduction to Wen-Tsun Wu's academic career. 586-588 - Bruno Buchberger, Markus Rosenkranz:
Transforming problems from analysis to algebra: A case study in linear boundary problems. 589-609 - Changbo Chen, Marc Moreno Maza:
Algorithms for computing triangular decomposition of polynomial systems. 610-642 - William Y. C. Chen, Qing-Hu Hou, Yan-Ping Mu:
The extended Zeilberger algorithm with parameters. 643-654 - Xiao-Shan Gao, Zhenyu Huang:
Characteristic set algorithms for equation solving in finite fields. 655-679 - Evelyne Hubert, Marie-Paule Cani:
Convolution surfaces based on polygonal curve skeletons. 680-699 - Nan Li, Lihong Zhi:
Computing the multiplicity structure of an isolated singular solution: Case of breadth one. 700-710 - Ziming Li, Min Wu:
Transforming linear functional systems into fully integrable systems. 711-732 - Xuhui Wang, Falai Chen:
Implicitization, parameterization and singularity computation of Steiner surfaces using moving surfaces. 733-750
Volume 47, Number 7, July 2012
- Jeremy R. Johnson, Erich L. Kaltofen, Hyungju Park:
Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. 751 - Ana Romero, Julio Rubio:
Computing the homology of groups: The geometric way. 752-770 - Luca De Feo, Éric Schost:
Fast arithmetics in Artin-Schreier towers over finite fields. 771-792 - Wei Zhou, George Labahn:
Efficient algorithms for order basis computation. 793-819 - Ioannis Z. Emiris, Angelos Mantzaflaris:
Multihomogeneous resultant formulae for systems with scaled support. 820-842 - Jin-San Cheng, Xiao-Shan Gao, Leilei Guo:
Root isolation of zero-dimensional polynomial systems with linear univariate representation. 843-858 - Christopher W. Brown:
Fast simplifications for Tarski formulas based on monomial inequalities. 859-882 - Hoon Hong, Mohab Safey El Din:
Variant quantifier elimination. 883-901
Volume 47, Number 8, August 2012
- Daouda Niang Diatta, Bernard Mourrain, Olivier Ruatta:
On the isotopic meshing of an algebraic implicit surface. 903-925 - Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Ludovic Perret:
On the relation between the MXL family of algorithms and Gröbner basis algorithms. 926-941 - Teresa Krick, Ágnes Szántó:
Sylvester's double sums: An inductive proof of the general case. 942-953 - David Harvey:
The Karatsuba integer middle product. 954-967 - Shaoshi Chen, Manuel Kauers:
Trading order for degree in creative telescoping. 968-995 - Mordechai Katzman, Karl Schwede:
An algorithm for computing compatibly Frobenius split subvarieties. 996-1008
Volume 47, Number 9, September 2012
- Nicolas Peltier, Viorica Sofronie-Stokkermans:
First-order theorem proving: Foreword. 1009-1010 - Peter Baumgartner, Björn Pelzer, Cesare Tinelli:
Model Evolution with equality - Revised and implemented. 1011-1045 - Christian Mahesh Hansen, Roger Antonsen, Martin Giese, Arild Waaler:
Incremental variable splitting. 1046-1065 - Silvio Ranise:
On the verification of security-aware E-services. 1066-1088 - Christoph Wernhard:
Projection and scope-determined circumscription. 1089-1108 - Claus-Peter Wirth:
lim+, δ+, and Non-Permutability of β-Steps. 1109-1135
Volume 47, Number 10, October 2012
- Viktor Levandovskyy, Dusan Pagon, Marko Petkovsek, Valery G. Romanovski:
Foreword from the Editors. 1137-1139
- Douglas S. Shafer:
Symbolic computation and the cyclicity problem for singularities. 1140-1153
- Zhiheng Yu, Lu Yang, Weinian Zhang:
Discussion on polynomials having polynomial iterative roots. 1154-1162 - Maoan Han, Valery G. Romanovski:
Isochronicity and normal forms of polynomial systems of ODEs. 1163-1174 - Mikhail H. Klin, Josef Lauri, Matan Ziv-Av:
Links between two semisymmetric graphs on 112 vertices via association schemes. 1175-1191 - Thomas Cluzeau, Alban Quadrat:
Serre's reduction of linear partial differential systems with holonomic adjoints. 1192-1213 - Viktor Levandovskyy, Kristina Schindelar:
Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases. 1214-1232 - Thomas Bächler, Vladimir P. Gerdt, Markus Lange-Hegermann, Daniel Robertz:
Algorithmic Thomas decomposition of algebraic and differential systems. 1233-1266 - Johannes Blümlein, Sebastian Klein, Carsten Schneider, Flavia Stan:
A symbolic summation approach to Feynman integral calculus. 1267-1289 - Clemens G. Raab:
Using Gröbner bases for finding the logarithmic part of the integral of transcendental functions. 1290-1296 - Giandomenico Boffi, Alessandro Logar:
Computing Gröbner bases of pure binomial ideals via submodules of Zn. 1297-1308
Volume 47, Number 11, November 2012
- Graham Ellis, Le Van Luyen:
Computational homology of n-types. 1309-1317 - Jordi Guàrdia, Enric Nart, Sebastian Pauli:
Single-factor lifting and factorization of polynomials over local fields. 1318-1346 - Mama Foupouagnigni, Wolfram Koepf, D. D. Tcheutia, P. Njionou Sadjang:
Representations of q-orthogonal polynomials. 1347-1371 - George E. Collins, Werner Krandick:
On the computing time of the continued fractions method. 1372-1412
Volume 47, Number 12, December 2012
- Nikolaj S. Bjørner, Laura Kovács:
Foreword. 1413-1415 - Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault:
Abstract interpretation meets convex optimization. 1416-1446 - Stéphane Gaubert, Ricardo Katz, Sergei Sergeev:
Tropical linear-fractional programming and parametric mean payoff games. 1447-1478 - Olivier Bouissou, Yassamine Seladji, Alexandre Chapoutot:
Acceleration of the abstract fixpoint computation in numerical program analysis. 1479-1511 - Peter Schrammel, Bertrand Jeannet:
Applying abstract acceleration to (co-)reachability analysis of reactive programs. 1512-1532 - Gianluca Amato, Maurizio Parton, Francesca Scozzari:
Discovering invariants via simple component analysis. 1533-1560
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 2024-12-03 20:31 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:
