Conférences et séminaires organisés depuis 2006

PolSys

  •  Design of Marx generators as a structured eigenvalue assignment
  •  Isomorphism problems in algebra
  •   The Skeletons you find when you Order your Ideal's Closet
  •   A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems
  •  On the Complexity of Solving Bivariate Systems
  •  Algebraic Attack against Wild McEliece & Incognito
  •  A Polynomial time attack on Wild McEliece over quadratic extensions
  •  New ways of finding relations in the Index Calculus for Jacobians of hyperelliptic curves
  •   Efficient probabilistic algorithm for computing the real dimension of real algebraic sets
  •  Root Separation Bounds
  •   Numerical Linear System Solving With Parametric Entries By Error Correction
  •   A new code based public key scheme based on list decoding
  •   On the complexity of computing Gröbner bases for weighted homogeneous systems
  •  Real algebraic geometry and infinite-dimensional conic optimization
  •  Algorithms to Compute Chern-Schwartz-Macpherson and Segre Classes and the Euler Characteristic
  •  Sparse Gröbner bases: the unmixed case
  •  Spaces of matrices with rank bounded above
  •   Effective Hilbert's Nullstellensatz and Finite Fields
  •  On the minimal support codewords of linear codes over GF(q) and a note about IP equivalence classes
  •  Extending Constructive Solid Geometry to Projections and Parametric Objects
  •  Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
  •  Constructing and using fast, twist-secure elliptic curves
  •  Computing efficiently real points on determinantal varieties
  •  An application of Algebraic Geometry to the contrast problem in Nuclear Magnetic Resonance
  •  Real roots of polynomial systems, semi-definite programming and border basis
  •  How to avoid communication in linear algebra and beyond
  •  Résolution des Systèmes Polynomiaux par les bases de Gröbner