Équipes actuelles : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Ancienne équipe : | ACASA |
- G. Ars, A. Hashemi : “Efficient Computation of Syzygies by Faugere's F5 algorithm”, MACIS 2007: Mathematical Aspects of Computer and Information Sciences, Paris, France [Ars 2007]
- D. Augot, M. Bardet, J.‑Ch. Faugère : “On formulas for decoding binary cyclic codes”, IEEE International Symposium on Information Theory, 2007 (ISIT 2007), Nice, France, pp. 2646-2650, (IEEE) [Augot 2007]
- O. Bodini, Th. Fernique, É. Rémila : “A Characterization of Flip-Accessibility for Rhombus Tilings of the Whole Plane”, LATA 2007 - 1st International Conference on Language and Automata Theory and Applications, Tarragona, Spain, pp. 139-150 [Bodini 2007a]
- O. Bodini, Th. Fernique, É. Rémila : “Characterizations of Flip-Accessibility for Domino Tilings of the Whole Plane”, FPSAC 2007 - 19th international conference on Formal Power Series and Algebraic Combinatorics, Tianjin, China, pp. 10 [Bodini 2007b]
- A. Darrasse, M. Soria : “Degree distribution of random Apollonian network structures and Boltzmann sampling”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), DMTCS Proceedings, Juan les Pins, France, pp. 313-324, (Discrete Mathematics and Theoretical Computer Science) [Darrasse 2007]
- H. Everett, D. Lazard, S. Lazard, M. Safey El Din : “The Voronoi Diagram of Three Lines”, Proceedings of the twenty-third annual symposium on Computational geometry, Gyeongju, Korea, Republic of, pp. 255-264, (ACM) [Everett 2007]
- J.‑Ch. Faugère, Y. Liang : “Numerical Computation of Grobner Bases for Zero-dimensional Polynomial Ideals”, Mathematical Aspects of Computer and Information Sciences 2007, Paris, France, Paris, France [Faugère 2007]
- S. Graillat, V. Ménissier‑Morain : “Error-Free Transformations in Real and Complex Floating Point Arithmetic”, Proceedings of International Symposium on Nonlinear Theory and its Applications (NOLTA'07), Vancouver, Canada, pp. 341-344 [Graillat 2007c]
- A. Hashemi : “Efficient Algorithms for Computing Noether Normalization”, ASCM 2007: The 8th ASian Symposium on Computer Mathematics, vol. 5081, Lecture Notes in Computer Science, Singapore, Singapore, pp. 97-107, (Springer) [Hashemi 2007a]
- A. Hashemi : “Polynomial-Time Algorithm for Hilbert Series of Borel Type Ideals”, SNC'07: Symbolic-Numeric Computation'07, London, Ontario, Canada, pp. 97-102, (ACM) [Hashemi 2007c]
- D. Lazard, S. McCallum : “Iterated Discriminants”, MEGA 2007: Effective Methods in Algebraic Geometry, Strobl, Austria [Lazard 2007b]
- B. Pagano, B. Canou, E. Chailloux, J.‑L. Colaço, Ph. Wang : “Couverture de code Caml pour la réalisation d'outils de développement certifiés”, Journées Francophones des Langages Applicatifs (JFLA 2007), Aix-les-Bains, France, pp. 71-86 [Pagano 2007]
- M. Safey El Din : “Algorithmes efficaces en géométrie algébrique réelle”, Journées Nationales de Calcul Formel, Marseille, France, pp. 1-126 [Safey El Din 2007a]
- M. Safey El Din : “Real solving polynomial systems of inequalities: the case of bounded sets of solutions”, Mathematical Aspects of Computer and Information Sciences 2007, Paris, France [Safey El Din 2007b]
- M. Safey El Din, Ph. Trébuchet : “POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations”, PASCO 2007 - 2007 international workshop on Parallel symbolic computation, London, Ontario, Canada, pp. 104-106, (ACM) [Safey El Din 2007d]
- M. Sugita, M. Kawazoe, L. Perret, H. Imai : “Algebraic Cryptanalysis of 58-Round SHA-1”, Fast Software Encryption, 14th International Workshop, FSE, vol. 4593, Lecture Notes in Computer Science, Luxembourg, Luxembourg, pp. 349-365, (Springer) [Sugita 2007]