ISSAC 2007: Waterloo, Ontario, Canada

Contributed papers

• Moulay A. Barkatou, Eckhard Pflügel:
  Computing super-irreducible forms of systems of linear differential equations via moser-reduction: a new approach. 1-8
  
• Dario Andrea Bini, Paola Boito:
  Structured matrix-based methods for polynomial in-gcd: analysis and comparisons. 9-16
  
• Marco Bodrato, Alberto Zanoni:
  Integer and polynomial multiplication: towards optimal toom-cook matrices. 17-24
  
• Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf, Éric Schost:
  Differential equations for algebraic functions. 25-32
  
• Alin Bostan, Claude-Pierre Jeannerod, Éric Schost:
  Solving toeplitz- and vandermonde-like linear systems with large displacement rank. 33-40
  
• Murray R. Bremner, Michael J. Hancock, Yunfeng Piao:
  Nonassociative structures on polynomial algebras arising from bio-operations on formal languages: an application of computer algebra to nonassociative systems. 41-48
  
• Alain Bretto, Luc Gillibert:
  G-graphs for the cage problem: a new upper bound. 49-53
  
• Christopher W. Brown, James H. Davenport:
  The complexity of quantifier elimination and cylindrical algebraic decomposition. 54-60
  
• Peter Bürgisser, Peter Scheiblechner:
  Differential forms in computational algebraic geometry. 61-68
  
• Laurent Busé, Marc Dohm:
  Implicitization of bihomogeneous parametrizations of algebraic surfaces via linear syzygies. 69-76
  
• Jacques Carette:
  A canonical form for piecewise defined functions. 77-84
  
• Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Paul Zimmermann, Eugene V. Zima:
  Time-and space-efficient evaluation of some hypergeometric constants. 85-91
  
• Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap:
  Complete numerical isolation of real zeros in zero-dimensional triangular systems. 92-99
  
• Serena Cicalò, Willem A. de Graaf:
  Non-associative gröbner bases, finitely-presented lie rings and the engel condition. 100-107
  
• Robert M. Corless, Dawit Assefa:
  Jeffery-hamel flow with maple: : a case study of integration of elliptic functions in a cas. 108-115
  
• Robert M. Corless, Hui Ding, David J. Jeffrey:
  The solution of s exp(s) = a is not always the lambert w function of a. 116-121
  
• Elena S. Dimitrova, Abdul Salam Jarrah, Reinhard C. Laubenbacher, Brandilyn Stigler:
  A Gröbner fan method for biochemical network modeling. 122-126
  
• Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P. Tsigaridas:
  On the complexity of real solving bivariate systems. 127-134
  
• Raouf Dridi, Michel Petitot:
  Towards a new ode solver based on cartan's equivalence method. 135-142
  
• Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
  Faster inversion and other black box matrix computations using efficient block projections. 143-150
  
• Arno Eigenwillig, Michael Kerber, Nicola Wolpert:
  Fast and exact geometric analysis of real algebraic plane curves. 151-158
  
• Mohamed Elkadi, André Galligo:
  Systems of three polynomials with two separated variables. 159-166
  
• Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann:
  A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm. 167-174
  
• Luca Gemignani:
  Structured matrix methods for polynomial root-finding. 175-180
  
• Timo Hanke:
  The isomorphism problem for cyclic algebras and an application. 181-186
  
• Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
  A sparse modular GCD algorithm for polynomials over algebraic function fields. 187-194
  
• Jeremy Johnson, Xu Xu:
  Generating symmetric DFTs and equivariant FFT algorithms. 195-202
  
• Erich Kaltofen, Zhengfeng Yang:
  On exact and approximate interpolation of sparse rational functions. 203-210
  
• Masaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara:
  Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization. 211-218
  
• Manuel Kauers, Carsten Schneider:
  Symbolic summation with radical expressions. 219-226
  
• Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi:
  Minimum converging precision of the QR-factorization algorithm for real polynomial GCD. 227-234
  
• Daniel Kunkle, Gene Cooperman:
  Twenty-six moves suffice for Rubik's cube. 235-242
  
• Yosuke Kurata, Masayuki Noro:
  Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation. 243-250
  
• Alexander B. Levin:
  Gröbner bases with respect to several term orderings and multivariate dimension polynomials. 251-260
  
• Hongbo Li:
  A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization. 261-268
  
• Xin Li, Marc Moreno Maza, Éric Schost:
  Fast arithmetic for triangular sets: from theory to practice. 269-276
  
• John P. May, B. David Saunders, Zhendong Wan:
  Efficient matrix rank computation with application to the study of strongly regular graphs. 277-284
  
• P. Mihailescu, François Morain, Éric Schost:
  Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. 285-292
  
• Izumi Miyamoto:
  A computation of some multiply homogeneous superschemes from transitive permutation groups. 293-298
  
• Katsusuke Nabeshima:
  A speed-up of the algorithm for computing comprehensive Gröbner systems. 299-306
  
• Clément Pernet, Arne Storjohann:
  Faster algorithms for the characteristic polynomial. 307-314
  
• Eric Robinson, Jürgen Müller, Gene Cooperman:
  A disk-based parallel implementation for direct condensation of large permutation modules. 315-322
  
• James Ruffo:
  A straightening law for the Drinfel'd Lagrangian Grassmannian. 323-330
  
• Hiroshi Sekigawa:
  On real factors of real interval polynomials. 331-338
  
• Vikram Sharma:
  Complexity of real root isolation using continued fractions. 339-346
  
• Jacob N. Smith, Gabriel Dos Reis, Jaakko Järvi:
  Algorithmic differentiation in Axiom. 347-354
  
• Mark van Hoeij:
  Solving third order linear differential equations in terms of second order equations. 355-360
  
• Gilles Villard:
  Certification of the QR factor R and of lattice basis reducedness. 361-368
  
• Joachim von zur Gathen:
  Counting reducible and singular bivariate polynomials. 369-376
  
• Wenyuan Wu, Greg Reid:
  Symbolic-numeric computation of implicit riquier bases for PDE. 377-386
  

Tutorials

• David A. Cox:
  Gröbner bases: a sampler of recent developments. 387-388
  
• F. Schwarz:
  Loewy decomposition of linear differential equations. 389-390
  
• Gilles Villard:
  Some recent progress in exact linear algebra and related questions. 391-392
  

Last update Sat May 18 19:09:27 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page