Journal articles
Research reports
Thesis and Master
Preprints
Talks

[A11]
A. Ayad
Complexity of solving parametric polynomial systems.
To appear in Zap. Nauchn. Sem. S.Peterburg . Otdel. Mat. Inst. Steklov. (POMI), vol. 387 (2011) 
[A11]
A. Ayad
Newton polygons of polynomial ordinary differential equations.
To appear in International Journal of Mathematical Analysis, (2011). 
[A11]
A. Ayad
A note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation.
To appear in International Mathematical Forum, (2011). 
[A10]
A. Ayad
On computing absolutely irreducible components of parametric algebraic varieties of arbitrary dimension.
Computing, Springer Wien New York, vol. 89, no. 12 (2010), p. 45  68. 
[A10]
A. Ayad
On factoring parametric multivariate polynomials.
Adv. in Appl. Math., Elsevier, vol. 45, no. 4 (2010), p. 607  623. 
[AM10]
A. Ayad & C. Marché
Behavioral Properties of FloatingPoint Programs.
Submitted. 
[A10]
A. Ayad
A survey on the complexity of solving algebraic systems.
International Mathematical Forum, vol. 5, no. 7 (2010), p. 333  353. 
[A10]
A. Ayad
Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials.
International Journal of Algebra, vol. 4, no. 4 (2010), p. 173  188. 
[A10]
A. Ayad
A lecture on the complexity of factoring polynomials over global fields.
International Mathematical Forum, vol. 5, no. 10 (2010), p. 477  486. 
[A10]
A. Ayad
Puiseux series solutions of ordinary polynomial differential equations : Complexity study.
Acta Universitatis Apulensis, vol. 22 (2010), p. 79  92. 
[A10]
A. Ayad
On the Riccatti differential polynomials.
Acta Mathematica Universitatis Comenianae, vol. 2 (2010), p. 245  251. 
[A10]
A. Ayad
An algorithm for solving zerodimensional parametric systems of polynomial homogeneous equations.
Submitted. 
[A04]
A. Ayad
Complexity bound for the absolute factorization of parametric polynomials.
Zap. Nauchn. Sem. S.Peterburg . Otdel. Mat. Inst. Steklov. (POMI) 316, Teor. Slozhn. Vychisl. 9, 529, 224 (2004). Translation to Journal of Mathematical Sciences (N. Y.), 134 (2006), no. 5, p. 23252339.

[AM10]
A. Ayad & C. Marché
MultiProver Verification of FloatingPoint Programs. Dans IJCAR 2010  5th International Joint Conference on Automated Reasoning, J. Giesl and R. Hahnle (Eds.): IJCAR 2010, LNAI 6173, pp. 127141, 2010. SpringerVerlag Berlin Heidelberg 2010 Edinburgh, UK, July 1619, 2010. 
[A09]
Article and Poster A. Ayad
Deductive verification of floatingpoint programs in FramaC.
In MajecSTIC2009, Avignon, France, November 1618, 2009. 
[A05]
A. Ayad
Factorization and Resolution of parametric polynomials.
French national days for symbolic computations, JNCF 2005.
Research reports

[A09]
A. Ayad
On formal methods for certifying floatingpoint C programs.
INRIA Research report RR6927INRIA2009, projets: CerPAN, Hisseo, U3CAT, teams: ProVal and Démons.
Thesis and Master

[A06]
A. Ayad
Complexity of solving parametric polynomial systems
PhD thesis at the university of Rennes 1, October 2006. 
[A03]
A. Ayad
The Schubert polynomials and varieties.
Memory of DEA in Mathematics and their applications at the university of Claude Bernard Lyon 1. Advisor : Philippe Caldero, 2003.
Preprints

[A08]
A. Ayad
A note on the computation of Puiseux series solutions of the Riccatti equation associated with a homogeneous linear ordinary differential equation
Preprint IRMAR, Rennes 2008. 
[A07]
A. Ayad
On the complexity of solving ordinary differential equations in terms of Puiseux series.
Preprint IRMAR, Rennes 2007.
Talks

[A09]
A. Ayad
Behavioral study of floatingpoint numbers in C programs.
Talk in the seminary of the Software Safety Laboratory LSL, Saclay, France, October 2009. 
[A06]
A. Ayad
Complexity of computing parametric G.C.Ds.
Doctoral mathematics meetings, Rennes, France, May 2006. 
[A06]
A. Ayad
Complexity of the decomposition of parametric projective varieties into absolutely irreducible components.
Seminary of the research group " Real Algebraic Geometry, Symbolic Computation and Cryptography", IRMAR, April 2006. 
[A05]
A. Ayad
Factorization and resolution of parametric polynomials.
French national days for symbolic computations, JNCF 2005. 
[A05]
A. Ayad
Algorithm of absolute factorization of parametric multivariate polynomials.
Seminary of the research group Real Algebraic Geometry, Symbolic Computation and Cryptography, IRMAR, February 2005.