Gruppi di ricerca attuali : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Gruppo precedente : | ACASA |
- J.‑Ch. Faugère, D. Lubicz, D. Robert : “Computing modular correspondences for abelian varieties”, Journal of Algebra, vol. 343 (1), pp. 248-277, (Elsevier) [Faugère 2011d]
- J.‑Ch. Faugère, M. Safey El Din, P.‑J. Spaenlehauer : “Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity”, Journal of Symbolic Computation, vol. 46 (4), pp. 406-437, (Elsevier) [Faugère 2011e]
- J.‑Ch. Faugère, Y. Liang : “Artificial discontinuities of single-parametric Gröbner bases”, Journal of Symbolic Computation, vol. 46 (4), pp. 459-466, (Elsevier) [Faugère 2011g]
- A. Galligo, A. Poteaux : “Computing Monodromy via Continuation Methods on Random Riemann Surfaces”, Theoretical Computer Science, vol. 412 (16), pp. 1492-1507, (Elsevier) [Galligo 2011]
- A. Hashemi, D. Lazard : “Sharper complexity bounds for zero-dimensional Göbner bases and polynomial system solving”, International Journal of Algebra and Computation, vol. 21 (5), pp. 703-713, (World Scientific Publishing) [Hashemi 2011]
- Y. Huang, D. Wang : “Computing Intersection and Self-intersection Loci of Parametrized Surfaces Using Regular Systems and Gröbner Bases”, Computer Aided Geometric Design, vol. 28 (9), pp. 566-581, (Elsevier) [Huang 2011]
- P.‑V. Koseleff, D. Pecker : “Chebyshev diagrams for two-bridge knots”, Geometriae Dedicata, vol. 150 (1), pp. 405-425, (Springer Verlag) [Koseleff 2011a]
- P.‑V. Koseleff, D. Pecker : “Chebyshev Knots”, Journal of Knot Theory and Its Ramifications, vol. 20 (4), pp. 575-593, (World Scientific Publishing) [Koseleff 2011b]
- X. Li, Ch. Mou, W. Niu, D. Wang : “Stability Analysis for Discrete Biological Models Using Algebraic Methods”, Mathematics in Computer Science, vol. 5 (3), pp. 247-262, (Springer) [Li 2011]
- G. Moroz : “Properness Defects of Projection and Minimal Discriminant Variety”, Journal of Symbolic Computation, vol. 46 (10), pp. 1139-1157, (Elsevier) [Moroz 2011]
- A. Poteaux, M. Rybowicz : “Complexity bounds for the rational Newton-Puiseux algorithm over finite fields”, Applicable Algebra in Engineering, Communication and Computing, vol. 22 (3), pp. 187-217, (Springer Verlag) [Poteaux 2011]
- M. Safey El Din, E. Schost : “A baby steps/giant steps Monte Carlo algorithm for computing roadmaps in smooth compact real hypersurfaces”, Discrete and Computational Geometry, vol. 45 (1), pp. 181-220, (Springer Verlag) [Safey El Din 2011]
- D. Wang : “Algebraic Analysis of Stability and Bifurcation for Nonlinear Flight Dynamics”, Aeronautical Journal -New Series-, vol. 115 (1168), pp. 345-349, (Royal Aeronautical Society) [Wang 2011a]
- T. Zhao, D. Wang, H. Hong : “Solution Formulas for Cubic Equations Without or With Constraints”, Journal of Symbolic Computation, vol. 46 (8), pp. 904-918, (Elsevier) [Zhao 2011]