ISSAC 2006: Genoa, Italy
Barry M. Trager (Ed.): Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings. ACM 2006 ISBN 1-59593-276-3
Invited talks
- Joachim von zur Gathen: Who was who in polynomial factorization: 1. 2
- Hennie Poulisse: Computational communicative algebra. 3-4
- Christopher Umans: Group-theoretic algorithms for matrix multiplication. 5
Tutorials
- Marc Moreno Maza: Triangular decompositions of polynomial systems: from theory to practice. 8
Full papers
- Sergei A. Abramov: On the summation of P-recursive sequences. 17-22
- Jonathan M. Borwein, Chris H. Hamilton: Symbolic computation of multidimensional Fenchel conjugates. 23-30
- Alin Bostan, Frédéric Chyzak, Bruno Salvy, Thomas Cluzeau: Low complexity algorithms for linear recurrences. 31-38
- Phelim Boyle, Alex Potapchik: Application of high-precision computing for pricing arithmetic asian options. 39-46
- Arthur D. Chtcherba, Deepak Kapur: Conditions for determinantal formula for resultant of a polynomial system. 55-62
- Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving sparse rational linear systems. 63-70
- Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap: Almost tight recursion tree bounds for the Descartes method. 71-78
- Etienne Farcot: Symbolic numeric analysis of attractors in randomly generated piecewise affine models of gene networks. 79-86
- Akpodigha Filatei, Xin Li, Marc Moreno Maza, Éric Schost: Implementation techniques for fast polynomial arithmetic in a high-level programming environment. 93-100
- Pierrick Gaudry, François Morain: Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. 109-115
- Mark Giesbrecht, George Labahn, Wen-shin Lee: Symbolic-numeric sparse interpolation of multivariate polynomials. 116-123
- Michael Harrison, Josef Schicho: Rational parametrisation for degree 6 Del Pezzo surfaces using lie algebras. 132-137
- Joris van der Hoeven: Effective real numbers in Mmxlib. 138-145
- Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó: Approximate radical of ideals with clusters of roots. 146-153
- Jeremy R. Johnson, Werner Krandick, Kevin Lynch, David G. Richardson, Anatole D. Ruslanov: High-performance implementations of the Descartes method. 154-161
- Erich Kaltofen, Pascal Koiran: Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. 162-168
- Erich Kaltofen, Zhengfeng Yang, Lihong Zhi: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. 169-176
- Manuel Kauers, Carsten Schneider: Application of unspecified sequences in symbolic summation. 177-183
- Santiago Laplagne: An algorithm for the computation of the radical of an ideal. 191-195
- Daniel Lazard: Solving Kaltofen's challenge on Zolotarev's approximation problem. 196-203
- Nicolas Le Roux, Moulay A. Barkatou: Rank reduction of a class of pfaffian systems in two variables. 204-211
- Viktor Levandovskyy: Intersection of ideals with non-commutative subalgebras. 212-219
- Ziming Li, Michael F. Singer, Min Wu, Dabin Zheng: A recursive method for determining the one-dimensional submodules of Laurent-Ore modules. 220-227
- Manfred Minimair: Resultants of skewly composed polynomials. 228-233
- Izumi Miyamoto: An improvement of GAP normalizer function for permutation groups. 234-238
- Guillaume Moroz: Complexity of the resolution of parametric systems of polynomial equations and inequations. 246-253
- Max Neunhöffer, Ákos Seress: A data structure for a uniform approach to computations with finite groups. 254-261
- Masayuki Noro: Modular dynamic evaluation. 262-268
- Wei Pan, Dongming Wang: Uniform Gröbner bases for ideals generated by polynomials with parametric exponents. 269-276
- Guénaël Renault: Computation of the splitting field of a dihedral polynomial. 290-297
- Eric Robinson, Gene Cooperman: A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups. 298-305
- Rosario Rubio, J. Miguel Serradilla, M. Pilar Vélez: A note on implicitization and normal parametrization of rational curves. 306-309
- Hiroshi Sekigawa, Kiyoshi Shirayanagi: Locating real multiple zeros of a real interval polynomial. 310-317
- Akira Suzuki, Yosuke Sato: A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. 326-331
- William J. Turner: A block Wiedemann rank algorithm. 332-339
- Christiaan van de Woestijne: Surface parametrisation without diagonalisation. 340-344
- Wenyuan Wu, Greg Reid: Application of numerical algebraic geometry and numerical linear algebra to PDE. 345-352
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team