Forschungsgruppen zur Zeit : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Ehemalige Forschungsgruppe : | ACASA |
- O. Bodini, C. Pivoteau, E. Fusy : “Random Sampling of Plane Partitions”, Génération Aléatoire de structures COMbinatoires, GASCOM, Dijon, France, pp. 124-135 [Bodini 2006a]
- O. Bodini, S. Lefranc : “How to Tile by Dominoes the Boundary of a Polycube”, DGCI Discrete Geometry for Computer Imagery 2006, vol. 4245, Lecture Notes in Computer Science, Szeged, Hungary, pp. 630-638, (Elsevier) [Bodini 2006b]
- O. Bodini, Th. Fernique : “Planar Dimer Tilings”, 1st International Computer Science Symposium in Russia, vol. 3967, Lecture Notes in Computer Science, St. Petersburg, Russian Federation, pp. 104-113, (Springer) [Bodini 2006c]
- A.‑G. Bosser, E. Chailloux : “FITGap : un framework objet pour le développement de jeux massivement multi-joueurs”, Nouvelles Technologies de la Repartition (NOTERE'2006), Toulouse, France, pp. 119-130, (Hermes Sciences) [Bosser 2006]
- X. Chen, D. Wang : “Towards an Electronic Geometry Textbook (Extended Abstract)”, Proceedings of the 6th International Workshop on Automated Deduction in Geometry, vol. 4869, Lecture Notes in Computer Science, Pontevedra, Spain, pp. 1-23, (Springer) [Chen 2006]
- J.‑Ch. Faugère : “An efficient algorithm for computing Gröbner bases without reduction to zero. Applications in Cryptology.”, Special Semester on Groebner Bases D1, Linz, Austria [Faugère 2006a]
- J.‑Ch. Faugère : “Computation of Gb by change of ordering: comparing the efficiency of several algorithms”, Special Semester on Groebner Bases D1, Linz, Austria [Faugère 2006b]
- J.‑Ch. Faugère : “Grobner Bases and Cryptology: application to 2R-”, Workshop on Mathematical Cryptology, Santander, Spain, pp. 13-13 [Faugère 2006c]
- J.‑Ch. Faugère : “Solving Polynomial Systems with Grobner bases: application in Cryptology”, Computational Algebraic Geometry and Applications, Nice, France [Faugère 2006d]
- J.‑Ch. Faugère, L. Perret : “Cryptanalysis of 2R-- schemes”, Advances in Cryptology CRYPTO 2006, vol. 4117, Lecture Notes in Computer Science, Santa Barbara, California, United States, pp. 357-372, (Springer-Verlag) [Faugère 2006e]
- J.‑Ch. Faugère, L. Perret : “Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects”, International Workshop on Post-Quantum Cryptography 2006, Louvain, Belgium, pp. 67-84 [Faugère 2006f]
- J.‑Ch. Faugère, L. Perret : “Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects”, EuroCrypt 2006 Advances in Cryptology, vol. 4004, Lecture Notes in Computer Science, Saint Petersburg, Russian Federation, pp. 30-47, (Springer-Verlag) [Faugère 2006g]
- N. Gu, D. Lazard, F. Rouillier, Y. Xiang : “Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization Process”, Mathematical Aspects of Computer and Information Sciences, Beijing, China, pp. 100-112 [Gu 2006]
- A. Hashemi : “Strong Noether Position”, International Congress of Mathematical Software, Castro Urdiales, Spain [Hashemi 2006b]
- H. Hong, L. Li, T. Liang, D. Wang : “Solving Dynamic Geometric Constraints Involving Inequalities”, Proceedings of the 8th International Conference on Artificial Intelligence and Symbolic Computation, vol. 4120, Lecture Notes in Artificial Intelligence, Beijing, China, pp. 181-195, (Springer-Verlag) [Hong 2006b]
- D. Lazard : “Solving Kaltofen's Challenge on Zolotarev's Approximation Problem”, Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, Genova, Italy, pp. 196-203, (ACM) [Lazard 2006b]
- T. Liang, D. Wang : “Geometric Constraint Handling in Gool (Extended Abstract)”, Proceedings of the 6th International Workshop on Automated Deduction in Geometry, Pontevedra, Spain, pp. 66-73, (Universidad de Vigo) [Liang 2006a]
- T. Liang, D. Wang : “Towards a Geometric-Object-Oriented Language”, Automated Deduction in Geometry, vol. 3763, Lecture Notes in Artificial Intelligence, Gainesville, FL, United States, pp. 130-155, (Springer-Verlag) [Liang 2006b]
- M. Mezzarobba, M. Safey El Din : “Computing roadmaps in smooth real algebraic sets”, Transgressive Computing 2006, Granada, Spain, pp. 327-338 [Mezzarobba 2006]
- G. Moroz : “Complexity of the Resolution of Parametric Systems of Polynomial Equations and Inequations”, International Symposium on Symbolic and Algebraic Computation, Genova, Italy, pp. 246-253, (ACM Press) [Moroz 2006b]
- W. Pan, D. Wang : “Uniform Gröbner Bases for Ideals Generated by Polynomials with Parametric Exponents”, Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, Genova, Italy, pp. 269-276, (ACM Press) [Pan 2006]
- G. Renault : “Computation of the Splitting Field of a Dihedral Polynomial”, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, Genova, Italy, pp. 290-297, (ACM Press) [Renault 2006a]
- G. Renault, K. Yokoyama : “A Modular Method for Computing the Splitting Field of a Polynomial”, Algorithmic Number Theory Symposium 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, vol. 4076, Lecture Notes in Computer Science, Berlin, Germany, pp. 124-140, (Springer-Verlag) [Renault 2006b]
- M. Safey El Din : “Critical Point Method: theory and practice using Grobner Bases”, Special Semester on Groebner Bases, Linz, Austria [Safey El Din 2006a]
- M. Safey El Din : “Generalized critical values and testing sign conditions on a polynomial”, Proceedings of International Conference on Mathematical Aspects of Computer and Information Sciences, Beijing, China, pp. 61-84 [Safey El Din 2006b]
- Ph. Trébuchet : “Generalized Normal Forms for polynomial system solving”, Workshop on application of Groebner Bases, Linz, Austria [Trébuchet 2006a]
- Ph. Trébuchet : “Strong Bi-Homogeneous Bezout theorems and algebraic Geometry”, Elimination Theory and Applications, Luminy, France [Trébuchet 2006b]