default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 50
Volume 50, March 2013
- Toshinori Oaku:
Algorithms for integrals of holonomic functions over domains defined by polynomial inequalities. 1-27 - Ming Xu
, Zhi-Bin Li:
Symbolic termination analysis of solvable loops. 28-49 - Robert D. Gray, António Malheiro, Stephen J. Pride:
Homotopy bases and finite derivation type for Schützenberger groups of monoids. 50-78 - Béla Paláncz:
Application of Dixon resultant to satellite trajectory control by pole placement. 79-99 - A. S. Detinko, Dane L. Flannery, Eamonn A. O'Brien:
Recognizing finite matrix groups over infinite fields. 100-109 - Adrien Poteaux, Éric Schost:
On the complexity of computing with zero-dimensional triangular sets. 110-138 - Marcus Bishop, J. Matthew Douglass, Götz Pfeiffer, Gerhard Röhrle:
Computations for Coxeter arrangements and Solomon's descent algebra: Groups of rank three and four. 139-158 - Thomas Peter, Gerlind Plonka, Daniela Rosca:
Representation of sparse Legendre expansions. 159-169 - Bjarke Hammersholt Roune, Eduardo Sáenz-de-Cabezón:
Complexity and algorithms for Euler characteristic of simplicial complexes. 170-196 - Carlos A. Cadavid, Sergio Molina, Juan D. Velez:
Limits of quotients of bivariate real analytic functions. 197-207 - Marie-Françoise Roy, Sidi Mohamed Sedjelmaci:
New fast euclidean algorithms. 208-226 - Joris van der Hoeven, Grégoire Lecerf:
On the bit-complexity of sparse polynomial and series multiplication. 227-254 - Edoardo Ballico, Michele Elia, Massimiliano Sala:
On the evaluation of multivariate polynomials over finite fields. 255-262 - Cristina Bertone, Francesca Cioffi, Paolo Lella, Margherita Roggero:
Upgraded methods for the effective computation of marked schemes on a strongly stable ideal. 263-290 - Alessandra Bernardi, Kristian Ranestad:
On the cactus rank of cubic forms. 291-297 - Alexander Hulpke:
Computing generators of groups preserving a bilinear form over residue class rings. 298-307 - Abramo Hefez, Marcelo Escudeiro Hernandes:
Algorithms for the implementation of the analytic classification of plane branches. 308-313 - Christopher J. Hillar, Abraham Martín del Campo:
Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. 314-334 - Dan Roozemond:
Computing split maximal toral subalgebras of Lie algebras over fields of small characteristic. 335-349 - Hülya Kadioglu, Tracy L. Payne:
Computational methods for nilsoliton metric Lie algebras I. 350-373 - Ivan Soprunov:
Toric complete intersection codes. 374-385 - Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan Chin, Xin Chen:
Loop invariant synthesis in a combined abstract domain. 386-408 - Joachim von zur Gathen:
Lower bounds for decomposable univariate wild polynomials. 409-430 - Meng Jin, Xiaoliang Li, Dongming Wang:
A new algorithmic scheme for computing characteristic sets. 431-449 - Luis Felipe Tabera:
Computing hypercircles by moving hyperplanes. 450-464 - Primoz Potocnik, Pablo Spiga, Gabriel Verret:
Cubic vertex-transitive graphs on up to 1280 vertices. 465-477 - Jason Morton:
Relations among conditional probabilities. 478-492 - Daniel J. Bates, David Eklund, Chris Peterson:
Computing intersection numbers of Chern classes. 493-507 - Sheng-Long Hu, Zheng-Hai Huang, Chen Ling, Liqun Qi:
On determinants and eigenvalue theory of tensors. 508-531 - John Abbott:
Bounds on factors in Z[x]. 532-563 - Bernard Mourrain, Nelly Villamizar:
Homological techniques for the analysis of the dimension of triangular spline spaces. 564-577
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-08-06 22:41 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
