 ISSAC'07 Home
 General Information
 Program
 Invited Speakers
 Contributed Papers
 Tutorials
 Contributed Posters
 Software Exhibits
 Conference Schedule
 Registration
 Local and Travel Information
 Calls for Participation
 Links
Sunday, July 29  
9:0011:30  Tutorial 1: Fritz Schwarz: Loewy Decomposition of Linear Differential Equations  
13:0015:30  Tutorial 2: David A. Cox: Gröbner Bases: A Sampler of Recent Developments  
16:0018:30  Tutorial 3: Gilles Villard: Some Recent Progress in Symbolic Linear Algebra and Related Questions  
18:3020:00  Welcome Reception (Davis Centre 1301: the Fishbowl) 
Monday, July 30  
9:009:25  Opening Ceremonies (DC1350)  
Linear Algebra I (DC1350)  Differential Equations I (DC1351)  
9:259:50  Alin Bostan, ClaudePierre Jeannerod and Éric Schost. Solving Toeplitz and Vandermondelike linear systems with large displacement rank 
Peter Bürgisser and Peter Scheiblechner. Differential forms in computational algebraic geometry 
9:5010:15  Gilles Villard. Certification of the QR Factor R, and of lattice basis reducedness 
Robert Corless, Hui Ding, Nick Higham and David J. Jeffrey. The solution of S exp S = A is not always the Lambert W function of A 
10:1510:45  Break  
Algorithmics (DC1350)  Differential Equations II (DC1351)  
10:4511:10  Alain Bretto and Luc Gillibert. Ggraphs for the cage problem: a new upper bound  Raouf Dridi and Michel Petitot. Towards a new ODE solver based on Cartan's equivalence method 
11:1011:35  Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima and Paul Zimmermann. Time and spaceefficient evaluation of some hypergeometric constants  Wenyuan Wu and Greg Reid. Symbolicnumeric computation of implicit Riquier bases for PDE 
11:3512:00  Pierrick Gaudry, Alexander Kruppa and Paul Zimmermann. A GMPbased implementation of SchönhageStrassen's large integer multiplication algorithm  Robert Corless and Dawit Assefa. JefferyHamel flow with Maple: A Case Study of Integration of Elliptic Functions in a CAS 
12:001:00  Lunch  
1:002:00  Software Demos (DC1302)  
2:003:00  Invited Talk: William Kahan (DC1350)  
3:003:20  Break  
SymbolicNumeric Computation (DC1350)  Differential Equations III (DC1351)  
3:203:45  Luca Gemignani. Structured matrix methods for polynomial rootfinding  Moulay Barkatou and Eckhard Pflügel. Computing superirreducible forms of systems of linear differential equations via Moserreduction: a new approach 
3:454:10  Dario Andrea Bini and Paola Boito. Structured matrixbased methods for polynomial εGCD: analysis and comparison  Alin Bostan, Frédéric Chyzak, Bruno Salvy, Grégoire Lecerf and Éric Schost. Differential equations for algebraic functions 
4:104:35  Pramook Khungurn, Hiroshi Sekigawa and Kiyoshi Shirayanagi. Minimum converging precision of the QRfactorization algorithm for real polynomial GCD  Mark van Hoeij. Solving third order linear differential equations in terms of second order equations 
4:456:00  ISSAC Business Meeting (DC1350)  
6:308:00  Maple Tutorial (MC3004) 
Tuesday, July 31  
Linear Algebra II (DC1350) 
Applications (DC1351) 

9:009:25  Clément Pernet and Arne Storjohann. Faster algorithms for the characteristic polynomial 
Murray R. Bremner, Michael J. Hancock and Yunfeng Piao. Nonassociative structures on polynomial algebras arising from biooperations on formal languages 
9:259:50  Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann and Gilles Villard. Faster inversion and other black box matrix computation using efficient block projections 
Elena Dimitrova, Abdul Salam Jarrah, Reinhard Laubenbacher and Brandilyn Stigler. A Gröbner fanbased method for biochemical network modeling 
9:5010:15  Marco Bodrato and Alberto Zanoni. Integer and polynomial multiplication: towards optimal ToomCook matrices  Masaaki Kanno, Hirokazu Anai, Shinji Hara and Kazuhiro Yokoyama. Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization 
10:1510:45  Break  
Sparse Polynomials (DC1350)  Enumeration (DC1351) 

10:4511:10  Erich Kaltofen and Zhengfeng Yang. On exact and approximate interpolation of sparse rational functions  Preda Mihailescu, Francois Morain and Éric Schost. Computing the eigenvalue in the SchoofElkiesAtkin algorithm using Abelian lift 
11:1011:35  Seyed Mohammad Mahdi Javadi and Michael Monagan. A sparse modular GCD algorithm for polynomials over algebraic function fields  TBA . > 
11:3512:00  Poster Session 

12:001:00  Lunch  JSC Editorial Board Lunch 
1:002:00  Poster Session  
2:003:00  Invited Talk: Jean Bernard Lasserre (DC1350)  
3:003:20  Break  
Geometry (DC1350)  Symbolic Manipulation (DC1351)  
3:203:45  Laurent Busé and Marc Dohm. Implicitization of Bihomogeneous parametrizations of algebraic surfaces via linear syzygies  Manuel Kauers and Carsten Schneider. Symbolic summation with radical expressions 
3:454:10  Mohamed Elkadi and André Galligo. Systems of three polynomials with two separated variables  Jacob Smith, Gabriel Dos Reis and Jaakko Järvi. Algorithmic differentiation in Axiom 
4:104:35  Arno Eigenwillig, Michael Kerber and Nicola Wolpert. Fast and exact geometric analysis of real algebraic plane curves  Jacques Carette. A canonical form for some piecewise defined functions 
6:3010:00  ISSAC Banquet (CIGI Building) 
Wednesday, August 1  
Real Solving and Complexity (DC1350)  Groups I (DC1351)  
9:009:25  Christopher Brown and James H. Davenport. The complexity of quantifier elimination and cylindrical algebraic decomposition  Daniel Kunkle and Gene Cooperman. TwentySix Moves Suffice for Rubik's Cube 
9:259:50  Vikram Sharma. Complexity of real root isolation using continued fractions  Eric Robinson, Gene Cooperman and Jürgen Müller. A diskbased parallel implementation for direct condensation of large permutation modules 
9:5010:15  Dimitrios I. Diochnos, Ioannis Z. Emiris and Elias P. Tsigaridas. On the complexity of real solving bivariate systems  Izumi Miyamoto. A computation of some multiply homogeneous superschemes from transitive permutation groups 
10:1510:45  Break  
Real Solving (DC1350)  Invariant Theory (DC1351)  
10:4511:10  Hiroshi Sekigawa. On real factors of real interval polynomials  Hongbo Li. A recipe for symbolic geometric computing: long geometric product 
11:1011:35  JinSan Cheng, XiaoShan Gao and Chee Yap. Complete numerical isolation of real zeros in general triangular systems  James Ruffo. A straightening law for the Drinfel'd Lagrangian Grassmannian 
11:3512:00  Xin Li, Marc Moreno Maza and Éric Schost. Fast arithmetic for triangular sets: from theory to practice  Serena Cicalò and Willem de Graaf. Nonassociative Gröbner bases, finitelypresented Lie rings and the Engel condition 
12:001:30  Lunch  
1:302:00  Maple Demo (DC1304)  
2:003:00  Invited Talk: Hoon Hong (DC1350)  
3:003:20  Break  
Gröbner Bases (DC1350)  Groups II (DC1351)  
3:203:45  Yosuke Kurata and Masayuki Noro. Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation  John P. May, David Saunders and Zhendong Wan. Efficient matrix rank computation with application to the study of strongly regular graphs 
3:454:10  Katsusuke Nabeshima. A speedup of the algorithm for computing comprehensive Gröbner systems  Jeremy Johnson and Xu Xu. Generating symmetric DFTs and equivariant FFT algorithms 
4:205:30  SIGSAM Business Meeting (DC1350)  
6:308:30  Maple Reception (Maplesoft  615 Kumpf Dr., Waterloo) 