Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISSAC 2008: Linz/Hagenberg, Austria
- J. Rafael Sendra, Laureano González-Vega:
Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings. ACM 2008, ISBN 978-1-59593-904-3 - Sergei A. Abramov
:
Power series and linear difference equations. 1-2 - Elizabeth L. Mansfield:
Digital atlases and difference forms. 3-4 - William A. Stein:
Can we create a viable free open source alternative to magma, maple, mathematica and matlab? 5-6
Contributed papers
- Felix Antritter, Jean Lévine:
Towards a computer algebraic algorithm for flat output determination. 7-14 - Moulay A. Barkatou, Gary Broughton, Eckhard Pflügel:
Regular systems of linear functional equations and applications. 15-22 - Alin Bostan, Frédéric Chyzak, Nicolas Le Roux:
Products of ordinary differential operators by evaluation and interpolation. 23-30 - Xuhui Wang, Falai Chen, Jiansong Deng:
Implicitization and parametrization of quadratic surfaces with one simple base point. 31-38 - Ruben Debeerst, Mark van Hoeij, Wolfram Koepf:
Solving differential equations in terms of bessel functions. 39-46 - Daouda Niang Diatta, Bernard Mourrain, Olivier Ruatta:
On the computation of the topology of a non-reduced implicit space curve. 47-54 - Michael Brickenstein, Alexander Dreyer:
Gröbner-free normal forms for boolean polynomials. 55-62 - Jean-Guillaume Dumas:
Q-adic transform revisited. 63-70 - Mohab Safey El Din:
Computing the global optimum of a multivariate polynomial over the reals. 71-78 - Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din:
Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. 79-86 - Michael A. Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap:
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. 87-94 - Vladimir P. Gerdt, Mikhail V. Zinin:
A pommaret division algorithm for computing Grobner bases in boolean rings. 95-102 - Mark Giesbrecht, Daniel S. Roche:
On lacunary polynomial perfect powers. 103-110 - Didier Henrion, Michael Sebek:
Plane geometry and convexity of polynomial stability regions. 111-116 - Matthias Aschenbrenner, Christopher J. Hillar:
An algorithm for finding symmetric Grobner bases in infinite dimensional rings. 117-124 - Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai:
Moment matrices, trace matrices and the radical of ideals. 125-132 - Manuel Kauers:
Integration of algebraic functions: a simple heuristic for finding the logarithmic part. 133-140 - Erich L. Kaltofen, Pascal Koiran:
Expressing a fraction of two determinants as a determinant. 141-146 - Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara:
Symbolic optimization of algebraic functions. 147-154 - Erich L. Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi:
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. 155-164 - Anton Leykin:
Numerical primary decomposition. 165-172 - Viktor Levandovskyy, Jorge Martín-Morales:
Computational D-module theory with singular, comparison with other systems and two new algorithms. 173-180 - Hongbo Li, Lei Huang:
Complex brackets, balanced complex differences, and applications in symbolic geometric computing. 181-188 - Songxin Liang, David J. Jeffrey, Marc Moreno Maza:
The complete root classification of a parametric polynomial on an interval. 189-196 - Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies:
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. 197-206 - François Lemaire, Marc Moreno Maza, Wei Pan, Yuzhen Xie:
When does (T) equal sat(T)? 207-214 - Melanie Achatz, Scott McCallum, Volker Weispfenning:
Deciding polynomial-exponential problems. 215-222 - Martin Peternell, Boris Odehnal:
On generalized ln-surfaces in 4-space. 223-230 - Eckhard Pflügel:
A rational decomposition-lemma for systems of linear differential-algebraic equations. 231-238 - Adrien Poteaux, Marc Rybowicz:
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields. 239-246 - Guénaël Renault, Kazuhiro Yokoyama:
Multi-modular algorithm for computing the splitting field of a polynomial. 247-254 - Zhibek Kadyrsizova, Valery G. Romanovski:
Linearizablity of 1: -3 resonant system with homogeneous cubic nonlinearities. 255-260 - Markus Rosenkranz, Georg Regensburger:
Integro-differential polynomials and operators. 261-268 - Alin Bostan, Bruno Salvy, Éric Schost:
Power series composition and change of basis. 269-276 - Dima Grigoriev, Fritz Schwarz:
Loewy decomposition of third-order linear aPDE's in the plane. 277-286 - Hiroshi Sekigawa:
The nearest polynomial with a zero in a given domain from a geometrical viewpoint. 287-294 - Ekaterina Shemyakova, Elizabeth L. Mansfield:
Moving frames for laplace invariants. 295-302 - Adam W. Strzebonski:
Real root isolation for exp-log functions. 303-314 - Massimo Caboara, Fabrizio Caruso, Carlo Traverso:
Gröbner bases for public key cryptography. 315-324 - Xiaoli Wu, Lihong Zhi:
Computing the multiplicity structure from geometric involutive form. 325-332
Tutorials
- Komei Fukuda:
Exact algorithms and software in optimization and polyhedral computation. 333-334 - Gregor Kemper:
Algorithmic invariant theory. 335-336 - Madhu Sudan:
Algebraic algorithms and coding theory. 337
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-18 21:31 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:
