ISSAC 2009: Seoul, Republic of Korea

• Marc Giusti:
  A Gröbner free alternative to solving and a geometric analogue to Cook's thesis. 1-2
  
• Tetsuo Ida:
  Symbolic and algebraic methods in computational origami: invited talk. 3-4
  
• Markus Püschel:
  Automatic synthesis of high performance mathematical programs. 5-6
  

Contributed papers

• Moulay A. Barkatou, Thomas Cluzeau, Carole El Bacha:
  Algorithms for regular solutions of higher-order linear differential systems. 7-14
  
• Bernhard Beckermann, George Labahn:
  Fraction-free computation of simultaneous padé approximants. 15-22
  
• Alexandre Benoit, Bruno Salvy:
  Chebyshev expansions for solutions of linear differential equations. 23-30
  
• Anna Maria Bigatti, Eduardo Sáenz-de-Cabezón:
  Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms. 31-38
  
• Frédéric Bihan, J. Maurice Rojas, Casey E. Stella:
  Faster real feasibility via circuit discriminants. 39-46
  
• Alin Bostan, Éric Schost:
  Fast algorithms for differential equations in positive characteristic. 47-54
  
• Brice Boyer, Jean-Guillaume Dumas, Clément Pernet, Wei Zhou:
  Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. 55-62
  
• Christopher W. Brown:
  Fast simplifications for Tarski formulas. 63-70
  
• Scott McCallum, Christopher W. Brown:
  On delineability of varieties in CAD-based quantifier elimination with two equational constraints. 71-78
  
• W. Dale Brownawell, Chee-Keng Yap:
  Lower bounds for zero-dimensional projections. 79-86
  
• Yongjae Cha, Mark van Hoeij:
  Liouvillian solutions of irreducible linear difference equations. 87-94
  
• Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang:
  Computing cylindrical algebraic decomposition via triangular decomposition. 95-102
  
• Jin-San Cheng, Xiao-Shan Gao, Jia Li:
  Root isolation for bivariate polynomial systems with local generic position method. 103-110
  
• Frédéric Chyzak, Manuel Kauers, Bruno Salvy:
  A non-holonomic systems approach to special function identities. 111-118
  
• Xavier Dahan:
  Size of coefficients of lexicographical Groöbner bases: the zero-dimensional, radical and bivariate case. 119-126
  
• Luca De Feo, Éric Schost:
  Fast arithmetics in artin-schreier towers over finite fields. 127-134
  
• Jean-Guillaume Dumas, Clément Pernet, B. David Saunders:
  On finding multiplicities of characteristic polynomial factors of black-box matrices. 135-142
  
• Ioannis Z. Emiris, Angelos Mantzaflaris:
  Multihomogeneous resultant formulae for systems with scaled support. 143-150
  
• Jean-Charles Faugère, Sajjad Rahmany:
  Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. 151-158
  
• Jon González-Sánchez, Laureano González-Vega, Alejandro Piñera-Nicolas, Irene Polo-Blanco, Jorge Caravantes, Ignacio F. Rúa:
  Analyzing group based matrix multiplication algorithms. 159-166
  
• Stef Graillat, Philippe Trebuchet:
  A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system. 167-174
  
• Miroslav Halás, Ülle Kotta, Ziming Li, Huaifu Wang, Chunming Yuan:
  Submersive rational difference systems and their accessibility. 175-182
  
• Hoon Hong, Mohab Safey El Din:
  Variant real quantifier elimination: algorithm and application. 183-190
  
• Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
  Schemes for deterministic polynomial factoring. 191-198
  
• Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
  On factorization of multivariate polynomials over algebraic number and function fields. 199-206
  
• Jean-Charles Faugère, Ludovic Perret:
  High order derivatives and decomposition of multivariate polynomials. 207-214
  
• Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara:
  Solution of algebraic riccati equations using the sum of roots. 215-222
  
• Daniel Kunkle, Gene Cooperman:
  Biased tadpoles: a fast algorithm for centralizers in large matrix groups. 223-230
  
• Daniel Andres, Viktor Levandovskyy, Jorge Martín-Morales:
  Principal intersection and bernstein-sato polynomial of an affine variety. 231-238
  
• Xin Li, Marc Moreno Maza, Wei Pan:
  Computations modulo regular chains. 239-246
  
• Kurt Mehlhorn, Michael Sagraloff:
  Isolating real roots of real polynomials. 247-254
  
• Martin Mevissen, Kosuke Yokoyama, Nobuki Takayama:
  Solutions of polynomial systems derived from the steady cavity flow problem. 255-262
  
• Michael B. Monagan, Roman Pearce:
  Parallel sparse polynomial multiplication using heaps. 263-270
  
• Ivan Morel, Damien Stehlé, Gilles Villard:
  H-LLL: using householder inside LLL. 271-278
  
• Sébastien Orange, Guénaël Renault, Kazuhiro Yokoyama:
  Computation schemes for splitting fields of polynomials. 279-286
  
• Georg Regensburger, Markus Rosenkranz, Johannes Middeke:
  A skew polynomial approach to integro-differential operators. 287-294
  
• Daniel S. Roche:
  Space- and time-efficient polynomial multiplication. 295-302
  
• Ana Romero, Graham Ellis, Julio Rubio:
  Interoperating between computer algebra systems: computing homology of groups with kenzo and GAP. 303-310
  
• Yosuke Sato, Akira Suzuki:
  Computation of inverses in residue class rings of parametric polynomial ideals. 311-316
  
• B. David Saunders, Bryan S. Youse:
  Large matrix, small rank. 317-324
  
• Alan P. Sexton, Volker Sorge, Stephen M. Watt:
  Computing with abstract matrix structures. 325-332
  
• Arne Storjohann:
  Integer matrix rank certification. 333-340
  
• Adam W. Strzebonski:
  Real root isolation for tame elementary functions. 341-350
  
• Akira Terui:
  An iterative method for calculating approximate GCD of univariate polynomials. 351-358
  
• Joachim von zur Gathen:
  The number of decomposable univariate polynomials. extended abstract. 359-366
  
• Zhonggang Zeng:
  The approximate irreducible factorization of a univariate polynomial: revisited. 367-374
  
• Wei Zhou, George Labahn:
  Efficient computation of order bases. 375-382
  

Tutorials

• Jean-Charles Faugère:
  Interactions between computer algebra (Gröbner bases) and cryptology. 383-384
  
• Markus Schweighofer:
  Describing convex semialgebraic sets by linear matrix inequalities. 385-386
  
• Chee-Keng Yap:
  Exact numerical computation in algebra and geometry. 387-388
  

Last update Wed Feb 15 05:11:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page