default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2010: Munich, Germany
- Wolfram Koepf:
Symbolic and Algebraic Computation, International Symposium, ISSAC 2010, Munich, Germany, July 25-28, 2010, Proceedings. ACM 2010, ISBN 978-1-4503-0150-3
Invited presentations
- Evelyne Hubert:
Algebraic invariants and their differential algebras. 1-2 - Siegfried M. Rump:
Verification methods: rigorous results using floating-point arithmetic. 3-4 - Ashish Tiwari:
Theory of reals for verification and synthesis of hybrid dynamical systems. 5-6
Tutorials
- Moulay A. Barkatou:
Symbolic methods for solving systems of linear ordinary differential equations. 7-8 - Jürgen Gerhard:
Asymptotically fast algorithms for modern computer algebra. 9-10 - Sergey P. Tsarev:
Transformation and factorization of partial differential systems: applications to stochastic systems. 11-12
Gröbner bases
- Shuhong Gao, Yinhua Guan, Frank Volny:
A new incremental algorithm for computing Groebner bases. 13-19 - Ernst W. Mayr
, Stephan Ritscher:
Degree bounds for Gröbner bases of low-dimensional polynomial ideals. 21-27 - Deepak Kapur, Yao Sun, Dingkang Wang:
A new algorithm for computing comprehensive Gröbner systems. 29-36
Differential equations
- Mark van Hoeij, Quan Yuan:
Finding all bessel type solutions for linear differential equations with rational function coefficients. 37-44 - Moulay A. Barkatou, Carole El Bacha, Eckhard Pflügel:
Simultaneously row- and column-reduced higher-order linear differential systems. 45-52 - Vladimir P. Gerdt, Daniel Robertz:
Consistency of finite difference approximations for linear PDE systems and its algorithmic verification. 53-59
CAD and quantifiers
- Adam W. Strzebonski:
Computation with semialgebraic sets represented by cylindrical algebraic formulas. 61-68 - Christopher W. Brown, Adam W. Strzebonski:
Black-box/white-box simplification and applications to quantifier elimination. 69-76 - Thomas Sturm, Christoph Zengler:
Parametric quantified SAT solving. 77-84
Diferential algebra I
- François Lemaire, Asli Ürgüplü:
A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebra. 85-92 - Dima Grigoriev, Fritz Schwarz:
Absolute factoring of non-holonomic ideals in the plane. 93-97 - Christine Berkesch, Anton Leykin:
Algorithms for Bernstein-Sato polynomials and multiplier ideals. 99-106
Polynomial algebra
- Feng Guo, Mohab Safey El Din, Lihong Zhi:
Global optimization of polynomials using generalized critical values and sums of squares. 107-114 - Bjarke Hammersholt Roune:
A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals. 115-122 - Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials: statement of results. 123-130 - Jean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret:
Decomposition of generic multivariate polynomials. 131-137
Seminumerical techniques
- Marc Mezzarobba:
NumGfun: a package for numerical and analytic computation with D-finite functions. 139-145 - Nicolas Brisebarre, Mioara Joldes:
Chebyshev interpolation polynomial-based tools for rigorous computing. 147-154 - Zijia Li, Zhengfeng Yang, Lihong Zhi:
Blind image deconvolution via fast approximate GCD. 155-162 - David Sevilla, Daniel Wachsmuth:
Polynomial integration on regions defined by a triangle and a conic. 163-170
Geometry
- Xiaoran Shi, Falai Chen:
Computing the singularities of rational space curves. 171-178 - Frank Sottile, Ravi Vakil, Jan Verschelde:
Solving schubert problems with Littlewood-Richardson homotopies. 179-186 - Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao:
Triangular decomposition of semi-algebraic systems. 187-194
Diffierential algebra II
- Manuel Kauers, Veronika Pillwein:
When can we detect that a P-finite sequence is positive? 195-201 - Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li:
Complexity of creative telescoping for bivariate rational functions. 203-210 - Manuel Kauers, Carsten Schneider:
Partial denominator bounds for partial linear difference equations. 211-218
Polynomial roots and solving
- Victor Y. Pan, Ailong Zheng:
Real and complex polynomial root-finding with eigen-solving and preprocessing. 219-226 - Sharon Hutton, Erich L. Kaltofen, Lihong Zhi:
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. 227-234 - Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving. 235-242 - Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
The DMM bound: multivariate (aggregate) separation bounds. 243-250
Theory and applications
- Costanza Conti, Luca Gemignani, Lucia Romani:
Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes. 251-256 - Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. 257-264 - Majid Khonji, Clément Pernet, Jean-Louis Roch, Thomas Roche, Thomas Stalinski:
Output-sensitive decoding for redundant residue systems. 265-272
Linear algebra
- Marco Bodrato:
A Strassen-like matrix multiplication suited for squaring and higher power computation. 273-280 - Claude-Pierre Jeannerod, Christophe Mouilleron:
Computing specified generators of structured matrix inverses. 281-288 - Wayne Eberly:
Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case. 289-296
Linear recurrences and diffierence equations
- Mark van Hoeij, Giles Levy:
Liouvillian solutions of irreducible second order linear difference equations. 297-301 - Yongjae Cha, Mark van Hoeij, Giles Levy:
Solving recurrence relations using local invariants. 303-309 - Sergei A. Abramov:
On some decidable and undecidable problems related to q-difference equations with parameters. 311-317
Arithmetic
- Alberto Zanoni:
Iterative Toom-Cook methods for very unbalanced long integer multiplication. 319-323 - David Harvey, Daniel S. Roche:
An in-place truncated fourier transform and applications to polynomial multiplication. 325-329 - Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable. 331-338
Software systems
- Steve Linton, Kevin Hammond, Alexander Konovalov, Abdallah Al Zain, Philip W. Trinder, Peter Horn, Dan Roozemond:
Easy composition of symbolic computation software: a new lingua franca for symbolic computation. 339-346 - Karl Rupp:
Symbolic integration at compile time in finite element methods. 347-354 - Vlad Slavici, Xin Dong, Daniel Kunkle, Gene Cooperman:
Fast multiplication of large permutations for disk, flash memory and RAM. 355-362
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 2025-12-23 00:30 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:
