Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Communications in Computer Algebra, Volume 45
Volume 45, Numbers 1/2, March / June 2011
- Daniel Lichtblau:
Symbolic definite (and indefinite) integration: methods and open issues. 1-16 - Robert M. Corless
, Erik Postma, David R. Stoutemyer:
Rounding coefficients and artificially underflowing terms in non-numeric expressions. 17-48 - Aaron Robertson, Vince Vatter, Gizel Maimon, Qing-Hu Hou:
Abstracts of conferences in honor of Doron Zeilberger's 60th birthday. 49-61 - Jeremy Johnson:
Abstracts of recent doctoral dissertations in computer algebra. 62
- Christian Eder, Justin Gash, John Edward Perry:
Modifying Faugère's F5 algorithm to ensure termination. 70-89 - Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée:
Philippe Flajolet: the father of analytic combinatorics. 90-91 - Ilias S. Kotsireas, Eugene V. Zima:
Abstracts of WWCA 2011 in honor of Herb Wilf's 80th birthday. 92-99 - John May:
East coast computer algebra day 2011 abstracts. 100-106
- Fatima K. Abu Salem:
Parallel and cache-efficient Hensel lifting. 107-108 - Mark Boady, Pavel Grinfeld, Jeremy Johnson:
A symbolic computation system for the calculus of moving surfaces. 109-110 - Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy:
Fast computation of common left multiples of linear ordinary differential operators. 111-112 - Muhammad F. I. Chowdhury, Romain Lebreton:
Root lifting techniques and applications to list decoding. 113-114 - Samaresh Chatterji, Ratnik Gandhi:
Computing equilibria with group actions. 115-116 - Md. Nazrul Islam, Adrien Poteaux:
Connectivity queries on curves in Rn. 117-118 - Hiroshi Kai, Shigenobu Inoue:
Cheater identification on a secret sharing scheme using GCD. 119-120 - Deepanjan Kesh, Shashank K. Mehta:
A saturation algorithm for homogeneous binomial ideals. 121-122 - Christos Koukouvinos, Dimitris E. Simos, Zafeirakis Zafeirakopoulos:
An algebraic framework for extending orthogonal designs. 123-124 - Yue Li, Gabriel Dos Reis:
An automatic parallelization framework for OpenAxiom. 125-126 - Marc Moreno Maza, Wei Pan:
Solving bivariate polynomial systems on a GPU. 127-128 - Marc Moreno Maza, Paul Vrbik:
Inverting matrices modulo regular chains. 129-130 - Hiroshi Sekigawa, Kiyoshi Shirayanagi:
Isolated real zero of a real polynomial system under perturbation. 131-132 - Clemens G. Raab:
Integration in finite terms of non-liouvillian functions. 133-134 - Hamid Rahkooy, Zafeirakis Zafeirakopoulos:
Using resultants for inductive Gröbner bases computation. 135-136 - Manuela Wiesinger-Widi:
Gröbner bases and generalized sylvester matrices. 137-138 - Christoph Zengler, Andreas Kübler, Wolfgang Küchlin:
New approaches to boolean quantifier elimination. 139-140 - Christoph Zengler, Wolfgang Küchlin:
Boolean Gröbner bases in SAT solving. 141-142 - Jeremy R. Johnson:
Abstracts of recent doctoral dissertations in computer algebra. 143-145
Volume 45, Numbers 3/4, September / December 2011
- Wolfgang Trinks:
On Buchberger's method of solving systems of algebraic equations. 150-161 - Akira Terui:
Abstracts from RIMS workshop on developments in computer algebra research. 162-165 - Changbo Chen, James H. Davenport, François Lemaire, Marc Moreno Maza, Bican Xia, Rong Xiao, Yuzhen Xie:
Computing the real solutions of polynomial systems with the RegularChains library in Maple. 166-168 - Jesús A. De Loera, Brandon E. Dutra, Matthias Köppe, S. Moreinis, G. Pinto, J. Wu:
Software for exact integration of polynomials over polyhedra. 169-172 - Felix Effenberger, Jonathan Spreer:
Simplicial blowups and discrete normal surfaces in simpcomp. 173-176 - Michael Joswig, Andreas Paffenholz:
Defect polytopes and counter-examples with polymake. 177-179 - Antonio Montes:
Software for computing the Gröbner cover of a parametric ideal. 180-182 - Alexander Raichev:
New software for computing asymptotics of multivariate generating functions. 183-185 - Joris van der Hoeven, Grégoire Lecerf, Bernard Mourrain, Philippe Trébuchet, Jérémy Berthomieu, Daouda Niang Diatta, Angelos Mantzaflaris:
Mathemagix: the quest of modularity and efficiency for symbolic and certified numeric computation? 186-188 - Loredana Tec:
A symbolic framework for general polynomial domains in theorema: applications to boundary problems. 189 - Johannes Middeke:
A computational view on normal forms of matrices of Ore polynomials. 190-191
- David R. Stoutemyer:
Ways to implement computer algebra compactly. 199-224 - David Joyner, Ondrej Certík, Aaron Meurer, Brian E. Granger:
Open source computer algebra systems: SymPy. 225-234 - Richard Dimick Jenks memorial prize 2011. 235
- Jónathan Heras:
Mathematical knowledge management in algebraic topology. 236-237 - Angelos Mantzaflaris:
Robust algebraic methods for geometric computing. 237 - Lam Xuan Châu Ngô:
Rational general solutions of first-order algebraic ODEs. 238 - Niels Lubbes:
Minimal families of curves on surfaces. 238-239 - Madalina Hodorog:
Symbolic-numeric algorithms for plane algebraic curves. 239-240
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 2024-04-22 20:03 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:
