Poster Presentations

List of Accepted Poster Presentations

  1. Joel (Ronnie) Nagloo, Alexey Ovchinnikov and Peter Thompson Commuting planar polynomial vector fields for conservative Newton systems.
    Abstract
  2. Joris van der Hoeven and Robin Larrieu. Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals.
    Abstract
  3. Alessandro Budroni and Federico Pintore. Hashing to G2 on BLS pairing-friendly curves.
    Abstract
  4. François Boulier, François Fages, Ovidiu Radulescu, Satya Swarup Samal, Andreas Schuppert, Werner Seiler, Thomas Sturm, Sebastian Walcher and Andreas Weber. The SYMBIONT Project: Symbolic Methods for Biological Networks.
    Abstract
  5. José Gómez Torrecillas, F. J. Lobillo and Gabriel Navarro. Minimum distance computation of linear codes via genetic algorithms with permutation encoding.
    Abstract
  6. Annie Cuyt and Wen-Shin Lee. A scale and shift paradigm for sparse interpolation in one and more dimensions.
    Abstract
  7. Simon Telen, Bernard Mourrain and Marc Van Barel. Truncated normal forms for solving polynomial systems.
    Abstract
  8. Curtis Bright, Ilias Kotsireas and Vijay Ganesh. The SAT+CAS Paradigm and the Williamson Conjecture.
    Abstract
  9. Laureano Gonzalez-Vega, Jorge Caravantes, Mario Fioravanti and Gema M. Diaz-Toca. Offsets to conics and quadrics: a new determinantal representation for their implicit equation.
    Abstract
  10. Johannes Middeke and Carsten Schneider. Towards a direct method for finding hypergeometric solutions of linear first order recurrence systems.
    Abstract
  11. Tudor Jebelean. Techniques for natural-style proofs in elementary analysis.
    Abstract
  12. Eugene Zima. Accelerating indefinite hypergeometric summation algorithms.
    Abstract
  13. Seung Gyu Hyun, Stephen Melczer and Catherine St-Pierre. Fast algorithm for solving linearly recurrent sequences.
    Abstract
  14. Ranjana Mehta, Joydip Saha and Indranath Sengupta. Unboundedness of Betti numbers of curves.
    Abstract
  15. Cameron Farnsworth and Jose Israel Rodriguez. Homogenized funtf varieties and algebraic frame completion.
    Abstract



The accepted poster/software abstracts will be published in an upcoming issue of the ACM SIGSAM Communications in Computer Algebra (CCA).

An award will be presented to the best poster/software presentation.