default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2016: Waterloo, ON, Canada
- Sergei A. Abramov, Eugene V. Zima, Xiao-Shan Gao:
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016. ACM 2016, ISBN 978-1-4503-4380-0
Invited Talks
- Ioannis Z. Emiris
:
Compact Formulae in Sparse Elimination. 1-4 - J. Ian Munro:
Succinct Data Structures ... Potential for Symbolic Computation? 5-8 - Carsten Schneider:
Symbolic Summation in Difference Rings and Applications. 9-12
Tutorials
- Clemens G. Raab:
Symbolic Computation of Parameter Integrals. 13-15 - Georg Regensburger:
Symbolic Computation with Integro-Differential Operators. 17-18 - Daniel Robertz:
Formal Algorithmic Elimination for PDEs. 19-22
Contributed Papers
- Juan Gerardo Alcázar, Carlos Hermoso, Georg Muntingh:
Detecting Similarities of Rational Space Curves. 23-30 - Xavier Allamigeon, Stéphane Gaubert, Mateusz Skomra:
Solving Generic Nonarchimedean Semidefinite Programs Using Stochastic Game Algorithms. 31-38 - Parisa Alvandi, Mahsa Kazemi, Marc Moreno Maza:
Computing Limits of Real Multivariate Rational Functions. 39-46 - Eric Bach, Rex D. Fernando:
Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test. 47-54 - Eric Bach, Bryce Sandlund:
Baby-Step Giant-Step Algorithms for the Symmetric Group. 55-62 - Moulay A. Barkatou, Thomas Cluzeau, Jacques-Arthur Weil, Lucia Di Vizio:
Computing the Lie Algebra of the Differential Galois Group of a Linear Differential System. 63-70 - Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. 71-78 - Matías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias P. Tsigaridas:
A Superfast Randomized Algorithm to Decompose Binary Forms. 79-86 - Valérie Berthé, Loïck Lhote, Brigitte Vallée:
Analysis of the Brun Gcd Algorithm. 87-94 - Jérémy Berthomieu, Jean-Charles Faugère:
Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra. 95-102 - Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron:
Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery. 103-110 - Alin Bostan, Xavier Caruso, Éric Schost:
Computation of the Similarity Class of the p-Curvature. 111-118 - Alin Bostan, Gilles Christol, Philippe Dumas:
Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field. 119-126 - Alin Bostan, Louis Dumont, Bruno Salvy:
Efficient Algorithms for Mixed Creative Telscoping. 127-134 - Brice Boyer, Christian Eder, Jean-Charles Faugère, Sylvian Lachartre, Fayssal Martani:
GBLA: Gröbner Basis Linear Algebra Package. 135-142 - Daniel A. Brake, Jonathan D. Hauenstein, Alan C. Liddell Jr.:
Validating the Completeness of the Real Solution Set of a System of Polynomial Equations. 143-150 - Cornelius Brand, Michael Sagraloff:
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. 151-158 - Xavier Caruso, David Roe, Tristan Vaccon:
Division and Slope Factorization of p-Adic Polynomials. 159-166 - Shaoshi Chen, Qing-Hu Hou, George Labahn, Rong-Hua Wang:
Existence Problem of Telescopers: Beyond the Bivariate Case. 167-174 - Shaoshi Chen, Manuel Kauers, Christoph Koutschan:
Reduction-Based Creative Telescoping for Algebraic Functions. 175-182 - Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds. 183-190 - Léo Ducas, Thomas Prest:
Fast Fourier Orthogonalization. 191-198 - Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard:
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. 199-206 - Wayne Eberly:
Selecting Algorithms for Black Box Matrices: Checking For Matrix Properties That Can Simplify Computations. 207-214 - Ioannis Z. Emiris, Angelos Mantzaflaris, Elias P. Tsigaridas:
On the Bit Complexity of Solving Bilinear Polynomial Systems. 215-222 - Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. 223-230 - Hao Fu, Guo-Niu Han:
Computer Assisted Proof for Apwenian Sequences. 231-238 - Richard Gustavson, Alexey Ovchinnikov, Gleb Pogudin:
Bounds for Orders of Derivatives in Differential Elimination Algorithms. 239-246 - Zhiwei Hao, Erich L. Kaltofen, Lihong Zhi:
Numerical Sparsity Determination and Early Termination. 247-254 - David Harvey, Joris van der Hoeven, Grégoire Lecerf:
Fast Polynomial Multiplication over F260. 255-262 - Albert Heinle, Viktor Levandovskyy:
A Factorization Algorithm for G-Algebras and Applications. 263-270 - Jiaxiong Hu, Michael B. Monagan:
A Fast Parallel Sparse Polynomial GCD Algorithm. 271-278 - Hui Huang:
New Bounds for Hypergeometric Creative Telescoping. 279-286 - Ming-Deh A. Huang, Lian Liu:
Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields. 287-294 - Claude-Pierre Jeannerod, Vincent Neiger, Éric Schost, Gilles Villard:
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts. 295-302 - Alexander Kobel, Fabrice Rouillier, Michael Sagraloff:
Computing Real Roots of Real Polynomials ... and now For Real! 303-310 - Robert Krone:
Equivariant Gröbner Bases of Symmetric Toric Ideals. 311-318 - Pierre Lairez, Tristan Vaccon:
On p-Adic Differential Equations with Separation of Variables. 319-323 - Jing-Cao Li, Cheng-Chao Huang, Ming Xu, Zhi-Bin Li:
Positive Root Isolation for Poly-Powers. 325-332 - Stephen Melczer, Bruno Salvy:
Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables. 333-340 - Guillaume Moroz, Éric Schost:
A Fast Algorithm for Computing the Truncated Resultant. 341-348 - Katsusuke Nabeshima, Katsuyoshi Ohara, Shinichi Tajima:
Comprehensive Gröbner Systems in Rings of Differential Operators, Holonomic D-modules and B-functions. 349-356 - Simone Naldi:
Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic. 357-364 - Vincent Neiger:
Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations. 365-372 - Arnold Neumaier, Damien Stehlé:
Faster LLL-type Reduction of Lattice Bases. 373-380 - Masayuki Noro:
System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal Regions. 381-388 - Clément Pernet:
Computing with Quasiseparable Matrices. 389-396 - Jamal Hossein Poor, Clemens G. Raab, Georg Regensburger:
Algorithmic Operator Algebras via Normal Forms for Tensors. 397-404 - Johan Sebastian Rosenkilde, Arne Storjohann:
Algorithms for Simultaneous Padé Approximations. 405-412 - Yi Zhang:
Contraction of Ore Ideals with Applications. 413-420
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-02 23:32 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:
