Person:272195: Difference between revisions

From MaRDI portal
Person:272195
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Éric Schost to Éric Schost: Duplicate
 
(No difference)

Latest revision as of 01:24, 10 December 2023

Available identifiers

zbMath Open schost.ericDBLP07/1002WikidataQ102439746 ScholiaQ102439746MaRDI QIDQ272195

List of research outcomes





PublicationDate of PublicationType
Sparse multiplication of multivariate linear differential operators2025-01-20Paper
Algorithms for linearly recurrent sequences of truncated polynomials2025-01-20Paper
An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases2024-12-09Paper
$p$-adic algorithm for bivariate Gr\"obner bases2023-12-21Paper
Faster real root decision algorithm for symmetric polynomials2023-11-03Paper
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology2023-11-03Paper
p-adic algorithm for bivariate Gröbner bases2023-11-03Paper
Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results2023-08-10Paper
Computing isomorphisms and embeddings of finite fields2023-03-03Paper
Sparse FGLM using the block Wiedemann algorithm2023-03-03Paper
Newton iteration for lexicographic Gr\"obner bases in two variables2023-02-07Paper
Bit complexity for critical point computation in smooth and compact real hypersurfaces2023-01-11Paper
Bit complexity for computing one point in each connected component of a smooth real algebraic set2022-11-21Paper
Computing critical points for invariant algebraic systems2022-11-21Paper
Bit complexity for computing one point in each connected component of a smooth real algebraic set2022-07-09Paper
Homotopy techniques for solving sparse column support determinantal polynomial systems2021-09-02Paper
Subquadratic-time algorithms for normal bases2021-07-14Paper
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields2021-02-18Paper
Solving determinantal systems using homotopy techniques2021-02-18Paper
On the bit complexity of finding points in connected components of a smooth real hypersurface2021-01-22Paper
Sparse multiplication for skew polynomials2021-01-22Paper
Algebraic construction of quasi-split algebraic tori2020-11-11Paper
Connectivity in Semi-Algebraic Sets I2020-11-04Paper
Foreword2020-09-19Paper
Quadratic-Time Algorithms for Normal Elements2020-09-10Paper
Change of Basis for m-primary Ideals in One and Two Variables2020-09-10Paper
Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants2020-09-10Paper
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module2020-09-10Paper
Algorithms for Structured Linear Systems Solving and Their Implementation2020-09-09Paper
Sparse Rational Univariate Representation2020-09-09Paper
Fast Computation of the Roots of Polynomials Over the Ring of Power Series2020-09-09Paper
Computing syzygies in finite dimension using fast linear algebra2020-08-17Paper
Block-Krylov techniques in the context of sparse-FGLM algorithms2020-01-15Paper
Computing isomorphisms and embeddings of finite fields2019-01-31Paper
On semiring complexity of Schur polynomials2018-12-10Paper
Simultaneous Conversions with the Residue Number System Using Linear Algebra2018-08-17Paper
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets2018-08-02Paper
Algorithms for zero-dimensional ideals using linear recurrent sequences2018-02-23Paper
Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization2018-01-12Paper
On the evaluation of some sparse polynomials2018-01-12Paper
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms2017-08-14Paper
Solving structured linear systems of large displacement rank2017-06-27Paper
Computing minimal interpolation bases2017-06-01Paper
Computation of the Similarity Class of the p-Curvature2017-05-10Paper
Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts2017-05-10Paper
A Fast Algorithm for Computing the Truncated Resultant2017-05-10Paper
Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations2017-04-28Paper
Explicit isogenies in quadratic time in any characteristic2017-04-04Paper
Fast algorithms for l -adic towers over finite fields2017-02-10Paper
On the complexity of solving bivariate systems2017-02-10Paper
Structured FFT and TFT2017-02-10Paper
Change of order for bivariate triangular sets2017-02-03Paper
Algorithms for Finite Field Arithmetic2016-09-29Paper
A Fast Algorithm for Computing the P-curvature2016-09-29Paper
A quadratically convergent algorithm for structured low-rank approximation2016-05-19Paper
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers2016-04-20Paper
A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve2015-11-25Paper
A fast algorithm for computing the characteristic polynomial of the p-curvature2015-11-11Paper
Fast arithmetic for the algebraic closure of finite fields2015-11-11Paper
A simple and fast online power series multiplication and its analysis2015-08-19Paper
Lifting techniques for triangular decompositions2015-07-16Paper
Multivariate power series multiplication2015-07-16Paper
Algorithms for the universal decomposition algebra2015-03-27Paper
Power series solutions of singular (q)-differential equations2015-03-27Paper
Computing in degree \(2^k\)-extensions of finite fields of odd characteristic2015-03-12Paper
transalpyne2015-02-26Paper
Complexity and performance results for non FFT-based univariate polynomial multiplication2015-02-20Paper
Almost linear time operations with triangular sets2015-02-20Paper
transalpyne2015-02-20Paper
Optimization techniques for small matrix multiplication2015-02-20Paper
A baby step-giant step roadmap algorithm for general algebraic sets2015-01-16Paper
https://portal.mardi4nfdi.de/entity/Q29346942014-12-18Paper
Doing Algebraic Geometry with the RegularChains Library2014-09-08Paper
Taking roots over high extensions of finite fields2013-11-15Paper
Modular composition modulo triangular sets and applications2013-09-30Paper
Multi-point evaluation in higher dimensions2013-02-21Paper
On the complexity of computing with zero-dimensional triangular sets2013-01-10Paper
Inversion Modulo Zero-Dimensional Regular Chains2012-09-21Paper
Fast arithmetics in Artin-Schreier towers over finite fields2012-05-23Paper
Fast algorithms for differential equations in positive characteristic2012-05-13Paper
Fast arithmetics in artin-schreier towers over finite fields2012-05-13Paper
Genus 2 point counting over prime fields2012-05-04Paper
Bit-size estimates for triangular sets in positive dimension2012-01-10Paper
Homotopy techniques for multiplication modulo triangular sets2011-12-19Paper
The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}2011-06-01Paper
Optimization techniques for small matrix multiplication2011-05-10Paper
A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface2011-03-10Paper
https://portal.mardi4nfdi.de/entity/Q30708062011-01-27Paper
A simple and fast algorithm for computing exponentials of power series2010-08-20Paper
Fast algorithms for computing isogenies between elliptic curves2010-08-03Paper
https://portal.mardi4nfdi.de/entity/Q35681382010-06-17Paper
On the geometry of polar varieties2010-03-01Paper
Fast conversion algorithms for orthogonal polynomials2009-12-18Paper
Code Generation for Polynomial Multiplication2009-11-10Paper
Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering2009-11-03Paper
Evaluation properties of invariant polynomials2009-10-09Paper
Interpolation of polynomials given by straight-line programs2009-07-10Paper
Fast arithmetic for triangular sets: from theory to practice2009-06-18Paper
Power series composition and change of basis2009-01-20Paper
https://portal.mardi4nfdi.de/entity/Q53016462009-01-20Paper
https://portal.mardi4nfdi.de/entity/Q53016472009-01-20Paper
https://portal.mardi4nfdi.de/entity/Q53016812009-01-20Paper
https://portal.mardi4nfdi.de/entity/Q53016832009-01-20Paper
Solving structured linear systems with large displacement rank2008-11-18Paper
Change of order for regular chains in positive dimension2008-03-11Paper
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator2008-01-03Paper
Fast computation of special resultants2007-10-23Paper
Advances in Cryptology - EUROCRYPT 20042007-09-25Paper
https://portal.mardi4nfdi.de/entity/Q34166842007-01-22Paper
EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS2006-08-14Paper
There is no efficient reverse derivation mode for discrete derivatives2005-12-29Paper
Polynomial evaluation and interpolation on special sets of points2005-09-02Paper
Algorithmic Number Theory2005-08-12Paper
Uniform bounds on the number of rational points of a family of curves of genus 22005-04-28Paper
https://portal.mardi4nfdi.de/entity/Q46606432005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46606712005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46607112005-04-04Paper
Complexity issues in bivariate polynomial factorization2005-03-14Paper
Sharp estimates for triangular sets2005-03-14Paper
On the complexities of multipoint evaluation and interpolation2005-02-09Paper
Properness defects and projections and computation of at least one point in each connected component of a real algebraic set2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48322762005-01-04Paper
Modular equations for hyperelliptic curves2004-10-07Paper
Complexity results for triangular sets2004-08-20Paper
https://portal.mardi4nfdi.de/entity/Q44742732004-08-04Paper
Fast algorithms for zero-dimensional polynomial systems using duality2004-02-05Paper
Computing parametric geometric resolutions2003-06-02Paper
https://portal.mardi4nfdi.de/entity/Q45318532002-05-23Paper
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexityN/APaper

Research outcomes over time

This page was built for person: Éric Schost