ISSAC 2011: San Jose, CA, USA

Invited presentations

• Victor S. Miller:
  Computational aspects of elliptic curves and modular forms. 1-2
  
• Gilles Villard:
  Recent progress in linear algebra and lattice basis reduction. 3-4
  

Tutorials

• Peter Bürgisser:
  Probabilistic analysis of condition numbers. 5-6
  
• Manuel Kauers:
  The concrete tetrahedron. 7-8
  
• Ágnes Szántó:
  Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview. 9-10
  

Contributed papers

• Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
  Border basis detection is NP-complete. 11-18
  
• Ainhoa Aparicio-Monforte, Moulay A. Barkatou, Sergi Simon, Jacques-Arthur Weil:
  Formal first integrals along solutions of differential systems I. 19-26
  
• Daniel Bembé, André Galligo:
  Virtual roots of a real polynomial and fractional derivatives. 27-34
  
• Alessandra Bernardi, Jérôme Brachat, Pierre Comon, Bernard Mourrain:
  Multihomogeneous polynomial decomposition using moment matrices. 35-42
  
• Jonathan M. Borwein, Armin Straub:
  Special values of generalized log-sine integrals. 43-50
  
• Curtis Bright, Arne Storjohann:
  Vector rational number reconstruction. 51-58
  
• Benjamin A. Burton:
  Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. 59-66
  
• Daniel Cabarcas, Jintai Ding:
  Linear algebra to compute syzygies and Gröbner bases. 67-74
  
• Changbo Chen, James H. Davenport, Marc Moreno Maza, Bican Xia, Rong Xiao:
  Computing with semi-algebraic sets represented by triangular decomposition. 75-82
  
• Changbo Chen, Marc Moreno Maza:
  Algorithms for computing triangular decompositions of polynomial systems. 83-90
  
• Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li:
  On the structure of compatible rational functions. 91-98
  
• Christian Eder, John Edward Perry:
  Signature-based algorithms to compute Gröbner bases. 99-106
  
• Tingting Fang, Mark van Hoeij:
  2-descent for second order linear differential equations. 107-114
  
• Jean-Charles Faugère, Chenqi Mou:
  Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. 115-122
  
• Mark Giesbrecht, Daniel S. Roche:
  Diversification improves interpolation. 123-130
  
• Aurélien Greuet, Mohab Safey El Din:
  Deciding reachability of the infimum of a multivariate polynomial. 131-138
  
• Leilei Guo, Feng Liu:
  An algorithm for computing set-theoretic generators of an algebraic variety. 139-146
  
• Li Guo, William Y. Sit, Ronghua Zhang:
  On Rota's problem for linear operators in associative algebras. 147-154
  
• Somit Gupta, Arne Storjohann:
  Computing hermite forms of polynomial matrices. 155-162
  
• William Hart, Mark van Hoeij, Andrew Novocin:
  Practical polynomial factoring in polynomial time. 163-170
  
• Erich Kaltofen, Michael Nehring, B. David Saunders:
  Quadratic-time certificates in linear algebra. 171-176
  
• Erich Kaltofen, Michael Nehring:
  Supersparse black box rational function interpolation. 177-186
  
• Jeremy-Yrmeyahu Kaminski, Yann Sepulcre:
  Using discriminant curves to recover a surface of P⁴ from two generic linear projections. 187-192
  
• Deepak Kapur, Yao Sun, Dingkang Wang:
  Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. 193-200
  
• Manuel Kauers, Carsten Schneider:
  A refined denominator bounding algorithm for multivariate linear difference equations. 201-208
  
• Michael Kerber, Michael Sagraloff:
  Efficient real root approximation. 209-216
  
• Hongbo Li, Ruiyong Sun, Shoubin Yao, Ge Li:
  Approximate rational solutions torational ODEs defined on discrete differentiable curves. 217-224
  
• Wei Li, Xiao-Shan Gao, Cum-Ming Yuan:
  Sparse differential resultant. 225-232
  
• Yue Li, Gabriel Dos Reis:
  An automatic parallelization framework for algebraic computation systems. 233-240
  
• Yue Ma, Lihong Zhi:
  The minimum-rank gram matrix completion via modified fixed point continuation method. 241-248
  
• Angelos Mantzaflaris, Bernard Mourrain:
  Deflation and certified isolation of singular zeros of polynomial systems. 249-256
  
• Ernst W. Mayr, Stephan Ritscher:
  Space-efficient Gröbner basis computation without degree bounds. 257-264
  
• Dustin Moody:
  Division polynomials for Jacobi quartic curves. 265-272
  
• Kosaku Nagasaka:
  Computing a structured Gröbner basis approximately. 273-280
  
• Victor Y. Pan, Guoliang Qian, Ailong Zheng:
  Randomized preconditioning of the MBA algorithm. 281-288
  
• Alexey Pospelov:
  Fast fourier transforms over poor fields. 289-296
  
• Soumojit Sarkar, Arne Storjohann:
  Normalization of row reduced matrices. 297-304
  
• B. David Saunders, David Harlan Wood, Bryan S. Youse:
  Numeric-symbolic exact rational linear system solver. 305-312
  
• Zhikun She, Bai Xue, Zhiming Zheng:
  Algebraic analysis on asymptotic stability of continuous dynamical systems. 313-320
  
• Adam W. Strzebonski, Elias P. Tsigaridas:
  Univariate real root isolation in an extension field. 321-328
  
• Thomas Sturm, Ashish Tiwari:
  Verification and synthesis using real quantifier elimination. 329-336
  
• Yao Sun, Dingkang Wang:
  A generalized criterion for signature related Gröbner basis algorithms. 337-344
  
• Mark van Hoeij, Jürgen Klüners, Andrew Novocin:
  Generating subfields. 345-352
  
• Chee-Keng Yap, Michael Sagraloff:
  A simple but exact and efficient algorithm for complex root isolation. 353-360
  

Last update Fri May 25 08:24:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page