Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2013: Boston, MA, USA
- Manuel Kauers:
International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013. ACM 2013, ISBN 978-1-4503-2059-7
Invited talks
- Henry Cohn:
Solving equations with size constraints for the solutions. 1-2 - Hendrik Lenstra:
Lattices with symmetry. 3-4 - Mohab Safey El Din:
Critical point methods and effective real algebraic geometry: new results and trends. 5-6 - Stephen Wolfram:
Computer algebra: a 32-year update. 7-8
Tutorials
- Pablo A. Parrilo:
Convex algebraic geometry and semidefinite optimization. 9-10 - Daniel E. Steffy:
Exact linear and integer programming: tutorial abstract. 11-12 - Mark van Hoeij:
The complexity of factoring univariatepolynomials over the rationals: tutorial abstract. 13-14
Contributed papers
- Andrew Arnold:
A new truncated fourier transform algorithm. 15-22 - Eric Bach, Jonathan P. Sorenson
:
Approximately counting semismooth integers. 23-30 - Romain Basson, Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling:
An explicit expression of the Lüroth invariant. 31-36 - Valérie Berthé, Jean Creusefond, Loïck Lhote, Brigitte Vallée:
Multiple GCDs. probabilistic analysis of the plain algorithm. 37-44 - Mariya Bessonov, Alexey Ovchinnikov, Maxwell Shapiro:
Integrability conditions for parameterized linear difference equations. 45-52 - Anton Betten:
Rainbow cliques and the classification of small BLT-sets. 53-60 - Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. 61-68 - Mark Boady, Pavel Grinfeld, Jeremy Johnson:
A term rewriting system for the calculus of moving surfaces. 69-76 - Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li, Guoce Xin:
Hermite reduction and creative telescoping for hyperexponential functions. 77-84 - Alin Bostan, Frédéric Chyzak, Elie de Panafieu:
Complexity estimates for two uncoupling algorithms. 85-92 - Alin Bostan, Pierre Lairez, Bruno Salvy:
Creative telescoping for rational functions using the griffiths: dwork method. 93-100 - François Boulier, François Lemaire, Georg Regensburger, Markus Rosenkranz:
On the integration of differential fractions. 101-108 - Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Rational univariate representations of bivariate systems and applications. 109-116 - Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier:
Separating linear forms for bivariate systems. 117-124 - Russell J. Bradford, James H. Davenport, Matthew England, Scott McCallum, David J. Wilson:
Cylindrical algebraic decompositions for boolean combinations. 125-132 - Christopher W. Brown:
Constructing a single open cell in a cylindrical algebraic decomposition. 133-140 - Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. 141-148 - Jingwei Chen, Damien Stehlé, Gilles Villard:
A new view on HJLS and PSLQ: sums and projections of lattices. 149-156 - Shaoshi Chen, Maximilian Jaroschek, Manuel Kauers, Michael F. Singer:
Desingularization explains order-degree curves for ore operators. 157-164 - Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for l-adic towers over finite fields. 165-172 - Alicia Dickenstein, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Combinatorics of 4-dimensional resultant polytopes. 173-180 - Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan:
Simultaneous computation of the row and column rank profiles. 181-188 - Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing gröbner bases for quasi-homogeneous systems. 189-196 - Qingdong Guo, Mohab Safey El Din, Lihong Zhi:
Computing rational solutions of linear matrix inequalities. 197-204 - Alexander Hulpke:
Calculation of the subgroups of a trivial-fitting group. 205-210 - Fredrik Johansson, Manuel Kauers, Marc Mezzarobba:
Finding hyperexponential solutions of linear ODEs by numerical evaluation. 211-218 - Erich L. Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery from values with noise and outlier errors. 219-226 - Yasuhito Kawano, Hiroshi Sekigawa:
Quantum fourier transform over symmetric groups. 227-234 - Vijay Jung Kunwar, Mark van Hoeij:
Second order differential equations with hypergeometric solutions of degree three. 235-242 - Laureano Lambán, Francisco-Jesús Martín-Mateos, Julio Rubio, José-Luis Ruiz-Reina:
Certified symbolic manipulation: bivariate simplicial polynomials. 243-250 - Romain Lebreton, Esmaeil Mehrabi, Éric Schost:
On the complexity of solving bivariate systems: the case of non-singular solutions. 251-258 - Viktor Levandovskyy, Grischa Studzinski, Benjamin Schnitzler:
Enhanced computations of gröbner bases in free algebras as a new application of the letterplace paradigm. 259-266 - Alexander B. Levin:
Multivariate difference-differential dimension polynomials and new invariants of difference-differential field extensions. 267-274 - Wei Li, Chun-Ming Yuan, Xiao-Shan Gao:
Sparse difference resultant. 275-282 - Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation. 283-290 - Senshan Pan, Yupu Hu, Baocang Wang:
The termination of the F5 algorithm revisited. 291-298 - Victor Y. Pan, Elias P. Tsigaridas:
On the boolean complexity of real root refinement. 299-306 - Colton Pauderis, Arne Storjohann:
Computing the invariant structure of integer matrices: fast algorithms into practice. 307-314 - Veronika Pillwein:
Termination conditions for positivity proving procedures. 315-322 - Clemens G. Raab:
Integration of unspecified functions and families of iterated integrals. 323-330 - Christian Eder, Bjarke Hammersholt Roune:
Signature rewriting in gröbner basis computation. 331-338 - Wenyuan Wu, Greg Reid:
Finding points on real solution components and applications to differential polynomial systems. 339-346 - Jean-Charles Faugère, Jules Svartz:
Gröbner bases of ideals invariant under a commutative group: the non-modular case. 347-354 - Joris van der Hoeven, Romain Lebreton, Éric Schost:
Structured FFT and TFT: symmetric and lattice polynomials. 355-362 - Joris van der Hoeven, Grégoire Lecerf:
Interfacing mathemagix with C++. 363-370 - Zhengfeng Yang, Lihong Zhi, Yijun Zhu:
Verified error bounds for real solutions of positive-dimensional polynomial systems. 371-378 - Wei Zhou, George Labahn:
Computing column bases of polynomial matrices. 379-386
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-25 20:48 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:
