Posters

 

List of accepted posters

  • Nader Bshouty. Testers and their Applications
  • Wenyuan Wu, Jingwei Chen and Yong Feng. An Efficient Algorithm to Factorize Sparse Bivariate Polynomials over the Rationals
  • George Labahn and Johannes Middeke. Gröbner walk for computing matrix normal forms
  • Luu Ba Thang. The matrix based representations of the intersection curves
  • Dejan Jovanović and Leonardo De Moura. Solving Non-Linear Arithmetic
  • Wei Li, Chun-Ming Yuan and Xiao-Shan Gao. Sparse Differential Resultant for Laurent Differential Polynomials
  • Esteban Segura Ugalde. Polynomial Root-finding via Structured Matrices
  • Vijay Kunwar and Mark van Hoeij. Finding 2F1 type solution of differential equations with 5 singularities
  • Xavier Dahan. On the structure of lexicographic Groebner bases in dimension zero
  • Konstantin Usevich and Ivan Markovsky. Variable projection methods for approximate GCD computations
  • Skander Belhaj and Haithem Benkahla. On the complexity of computing the GCD of two polynomials via Hankel matrices
  • Irtegov Valentin and Titorenko Tatiana. Symbolic Analysis of Dynamic Systems
  • Yongjae Cha and Veronika Pillwein. Closed form solutions of linear difference equations in terms of symmetric products
  • Louise Huot, Jean-Charles Faugère, Pierrick Gaudry and Guénaël Renault. Fast Change of Ordering with Exponent Omega
  • Ioannis Emiris and Tatjana Kalinka. Sparse Implicitization using Support Prediction
  • Claudia Fassino and Maria-Laura Torrente. Zero-dimensional ideals of limited precision points
  • Alberto Llorente and Jorge Mozo-Fernández. Numeric-symbolic methods for computing the Liouvillian solutions of differential equations and systems
  • Matthieu Deneufchâtel, Gerard H.E. Duchamp and Hoang Ngoc Minh Vincel. Dual families in Enveloping algebras
  • Laurent Hascoet, Shahadat Hossain and Trond Steihaug. Structured Computation in Optimization and Algorithmic Differentiation
  • Fatima K. Abu Salem. A Cache-Oblivious Engineering of the G2V Algorithm for Computing Groebner Bases
  • Felix Breuer and Zafeirakis Zafeirakopoulos. Partition Analysis via Polyhedral Geometry
  • Maximilian Jaroschek. Improved Polynomial Remainder Sequences for Ore Polynomials
  • Max Demenkov. Estimating region of attraction for polynomial vector fields by homotopy methods
  • Kosaku Nagasaka. Backward error analysis of approximate Gröbner basis
  • Hiroshi Sekigawa and Kiyoshi Shirayanagi. Maximal Perturbation for Preserving the Number of Solutions of a Polynomial System
  • Romain Lebreton, Esmaeil Mehrabi and Éric Schost. On the complexity of computing certain resultants
  • Hao Jiang, Stef Graillat and Roberto Barrio. Accurate Computing Elementary Symmetric Functions