Journal of Symbolic Computation, Volume 45, 2010

Volume 45, Number 1, January 2010

• Martin Peternell:
  Rational two-parameter families of spheres and rational offset surfaces. 1-18
  
• Claudia Fassino:
  Almost vanishing polynomials for sets of limited precision points. 19-37
  
• Alberto Damiano, Graziano Gentili, Daniele C. Struppa:
  Computations in the ring of quaternionic polynomials. 38-45
  
• Rouchdi Bahloul, Toshinori Oaku:
  Local Bernstein-Sato ideals: Algorithm and examples. 46-59
  
• Bahman Engheta:
  A bound on the projective dimension of three cubics. 60-73
  
• Temur Kutsia, Jordi Levy, Mateu Villaret:
  On the relation between Context and Sequence Unification. 74-95
  
• Inmaculada Medina-Bulo, Francisco Palomo-Lozano, José-Luis Ruiz-Reina:
  A verified Common Lisp implementation of Buchberger's algorithm in ACL2. 96-123
  
• François Boulier, François Lemaire, Marc Moreno Maza:
  Computing differential characteristic sets by change of ordering. 124-149
  

Volume 45, Number 2, February 2010

• Silvio Ghilardi, Viorica Sofronie-Stokkermans, Ulrike Sattler, Ashish Tiwari:
  Special issue on automated deduction: Decidability, complexity, tractability. 151-152
  
• Aharon Abadi, Alexander Rabinovich, Mooly Sagiv:
  Decidable fragments of many-sorted logic. 153-172
  
• Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari:
  Context unification with one context variable. 173-193
  
• Carsten Lutz, Frank Wolter:
  Deciding inseparability and conservative extensions in the description logic EL. 194-228
  
• Maria Paola Bonacina, Mnacho Echenim:
  Theory decision by decomposition. 229-260
  
• Duc-Khanh Tran, Christophe Ringeissen, Silvio Ranise, Hélène Kirchner:
  Combination of convex theories: Modularity, deduction completeness, and explanation. 261-286
  

Volume 45, Number 3, March 2010

• Ruyong Feng, Michael F. Singer, Min Wu:
  Liouvillian solutions of linear difference-differential equations. 287-305
  
• Ruyong Feng, Michael F. Singer, Min Wu:
  An algorithm to compute Liouvillian solutions of prime order linear difference-differential equations. 306-323
  
• Sonia L. Rueda, J. Rafael Sendra:
  Linear complete differential resultants and the implicitization of linear DPPEs. 324-341
  
• Allan K. Steel:
  Computing with algebraically closed fields. 342-372
  
• João Araújo, Paul von Bünau, James D. Mitchell, Max Neunhöffer:
  Computing automorphisms of semigroups. 373-392
  

Volume 45, Number 4, April 2010

• Tetsuo Ida, Hidekazu Takahashi:
  Origami fold as algebraic graph rewriting. 393-413
  
• Xiaohong Jia, Haohao Wang, Ron Goldman:
  Set-theoretic generators of rational space curves. 414-433
  
• Gabriela Jeronimo, Daniel Perrucci:
  On the minimum of a positive polynomial over the standard simplex. 434-442
  
• François Apéry:
  Subresultants of two Hermite-Laurent series. 443-461
  
• Kenta Nishiyama, Masayuki Noro:
  Stratification associated with local b-functions. 462-480
  
• Meera Sitharam, Jörg Peters, Yong Zhou:
  Optimized parametrization of systems of incidences between rigid bodies. 481-498
  

Volume 45, Number 5, May 2010

• Temur Kutsia:
  Symbolic computation in software science: Foreword from the editor. 499-500
  
• Sergio Antoy:
  Programming with narrowing: A tutorial. 501-522
  
• Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau:
  Anti-patterns for rule-based languages. 523-550
  
• Masaki Nakamura, Kazuhiro Ogata, Kokichi Futatsugi:
  Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications. 551-573
  
• Thomas Genet, Vlad Rusu:
  Equational approximations for tree automata completion. 574-597
  
• Masahiko Sato, Randy Pollack:
  External and internal syntax of the lambda-calculus. 598-616
  

Volume 45, Number 6, June 2010

• Prashant Batra, Vikram Sharma:
  Bounds on absolute positiveness of multivariate polynomials. 617-628
  
• Volker Gebhardt, Juan González-Meneses:
  Solving the conjugacy problem in Garside groups by cyclic sliding. 629-656
  
• Jan Vrsek, Miroslav Lávicka:
  On convolutions of algebraic curves. 657-676
  
• Kurt Mehlhorn, Saurabh Ray:
  Faster algorithms for computing Hong's bound on absolute positiveness. 677-683
  
• Sergei A. Abramov, Marko Petkovsek:
  Polynomial ring automorphisms, rational (w, sigma)-canonical forms, and the assignment problem. 684-708
  
• Andries E. Brouwer, Mihaela Popoviciu:
  The invariants of the binary nonic. 709-720
  

Volume 45, Number 7, July 2010

• Antonio Campillo, Patrick Fitzpatrick, Edgar Martínez-Moro, Ruud Pellikaan:
  Special issue algebraic coding theory and applications. 721-722
  
• Nigel Boston, Gary McGuire:
  The weight distributions of cyclic codes with two zeros and zeta functions. 723-733
  
• Nathan Owen Ilten, Hendrik Süß:
  Algebraic geometry codes from polyhedral divisors. 734-756
  
• Drue Coles, Emma Previato:
  Decoding by rank-2 bundles over plane quartics. 757-772
  
• Peter Beelen, Kristian Brander:
  Key equations for list decoding of Reed-Solomon codes and how to solve them. 773-786
  
• Sunghyu Han, Jon-Lark Kim:
  Formally self-dual additive codes over F₄. 787-799
  
• Washiela Fish, Jennifer D. Key, Eric Mwambene:
  Binary codes from the line graph of the n-cube. 800-812
  
• Carmen Martínez, Ramón Beivide, Cristobal Camarero, Esteban Stafford, Ernst M. Gabidulin:
  Quotients of Gaussian graphs and their application to perfect codes. 813-824
  

Volume 45, Number 8, August 2010

• Preda Mihailescu, Victor Vuletescu:
  Elliptic Gauss sums and applications to point counting. 825-836
  
• Andries E. Brouwer, Mihaela Popoviciu:
  The invariants of the binary decimic. 837-843
  
• Rida T. Farouki, Takis Sakkalis:
  Rational rotation-minimizing frames on polynomial space curves of arbitrary degree. 844-856
  
• Joris van der Hoeven:
  Newton's method and FFT trading. 857-878
  
• Joachim von zur Gathen, Maurice Mignotte, Igor Shparlinski:
  Approximate polynomial GCD: Small degree and small height perturbations. 879-886
  

Volume 45, Number 9, September 2010

• Gert-Martin Greuel, Santiago Laplagne, Frank Seelisch:
  Normalization of rings. 887-901
  
• Liang Chen, Michael B. Monagan:
  Algorithms for solving linear systems over cyclotomic fields. 902-917
  
• Huishi Li:
  Looking for Gröbner basis theory for (almost) skew 2-nomial algebras. 918-942
  
• Bettina Eick:
  Some new simple Lie algebras in characteristic 2. 943-951
  

Volume 45, Number 10, October 2010

• Eduardo Sáenz-de-Cabezón:
  Computing the support of monomial iterated mapping cones. 953-964
  
• Stefan O. Tohaneanu:
  On the De Boer-Pellikaan method for computing minimum distance. 965-974
  
• Maria Emilia Alonso, Henri Lombardi:
  Local Bézout Theorem. 975-985
  
• Joël Merker:
  Application of computational invariant theory to Kobayashi hyperbolicity and to Green-Griffiths algebraic degeneracy. 986-1074
  
• Marc Mezzarobba, Bruno Salvy:
  Effective bounds for P-recursive sequences. 1075-1096
  

Volume 45, Number 11, November 2010

• Martin Giese, Andrew Ireland, Laura Kovács:
  Introduction. 1097-1100
  
• Stefan Kauer, Jürgen F. H. Winkler:
  Mechanical inference of invariants for FOR-loops. 1101-1113
  
• Ali Mili, Shir Aharon, Chaitanya Nadkarni, Lamia Labed Jilani, Asma Louhichi, Olfa Mraihi:
  Reflexive transitive invariant relations: A basis for computing loop functions. 1114-1143
  
• Igor V. Konnov, Vladimir A. Zakharov:
  An invariant-based approach to the verification of asynchronous parameterized networks. 1144-1162
  
• Chenguang Luo, Florin Craciun, Shengchao Qin, Guanhua He, Wei-Ngan Chin:
  Verifying pointer safety for programs with unknown calls. 1163-1183
  
• Yannick Moy, Claude Marché:
  Modular inference of subprogram contracts for safety checking. 1184-1211
  
• Andrey Rybalchenko, Viorica Sofronie-Stokkermans:
  Constraint solving for interpolation. 1212-1233
  
• Bican Xia, Zhihai Zhang:
  Termination of linear programs with nonlinear constraints. 1234-1249
  

Volume 45, Number 12, December 2010

• Carlos D'Andrea, Marc Giusti, Luis M. Pardo, Ragni Piene:
  Effective methods in algebraic geometry 2009: Barcelona. Guest editors' foreword. 1251-1253
  
• Hirotachi Abo:
  On non-defectivity of certain Segre-Veronese varieties. 1254-1269
  
• Saugata Basu, Marie-Françoise Roy:
  Bounding the radii of balls meeting every connected component of semi-algebraic sets. 1270-1279
  
• Cristina Bertone, Guillaume Chèze, André Galligo:
  Modular Las Vegas algorithms for polynomial absolute factorization. 1280-1295
  
• María Angélica Cueto, Enrique A. Tobis, Josephine Yu:
  An implicitization challenge for binary factor analysis. 1296-1315
  
• Gema M. Diaz-Toca, Henri Lombardi:
  Dynamic Galois Theory. 1316-1329
  
• Amir Hashemi, Gwénolé Ars:
  Extended F₅ criteria. 1330-1340
  
• Pierre-Vincent Koseleff, D. Pecker, F. Rouillier:
  The first rational Chebyshev knots. 1341-1358
  
• J. M. Landsberg:
  P versus NP and geometry. 1359-1377
  
• Thierry Coquand, Henri Lombardi, Claude Quitté:
  Curves and coherent Prüfer rings. 1378-1390
  
• Antonio Montes, Michael Wibmer:
  Gröbner bases for polynomial systems with parameters. 1391-1425
  
• L. X. Châu Ngô, Franz Winkler:
  Rational general solutions of first order non-autonomous parametrizable ODEs. 1426-1441
  
• Christian Eder, John Edward Perry:
  F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases. 1442-1458
  
• Peter Scheiblechner:
  On a generalization of Stickelberger's Theorem. 1459-1470
  

Last update Tue May 21 19:19:30 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page