| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Publications APR | 2023 | 2024 | 2025 | Total |
|---|---|---|---|---|
| Books | 0 | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 | 0 |
| Journal articles | 10 | 5 | 0 | 15 |
| Book chapters | 0 | 0 | 0 | 0 |
| Conference papers | 7 | 10 | 0 | 17 |
| Habilitations | 1 | 0 | 0 | 1 |
| Thesis | 2 | 2 | 0 | 4 |
- Ph. Aubry, A. Valibouze : “Algebraic Computation of resolvents without extraneous powers”, European Journal of Combinatorics, vol. 33 (7), pp. 1369-1385, (Elsevier) [Aubry 2012a]
- Ph. Aubry, A. Valibouze : “Parallel computation of resolvents by multimodular techniques and decomposition formula”, International Journal of Algebra and Computation, vol. 22 (5), pp. 1-21, (World Scientific Publishing) [Aubry 2012b]
- O. Bodini, O. Roussel, M. Soria : “Boltzmann samplers for first-order differential specifications”, Discrete Applied Mathematics, vol. 160 (18), pp. 2563-2572, (Elsevier) [Bodini 2012c]
- M. Bourgoin, E. Chailloux, J.‑L. Lamotte : “SPOC: GPGPU PROGRAMMING THROUGH STREAM PROCESSING WITH OCAML”, Parallel Processing Letters, vol. 22 (2), pp. 1240007, (World Scientific Publishing) [Bourgoin 2012c]
- B.‑M. Bui‑Xuan, M. Habib, M. Rao : “Tree-representation of set families and applications to combinatorial decompositions”, European Journal of Combinatorics, vol. 33 (5), pp. 688-711, (Elsevier) [Bui-Xuan 2012]
- H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger : “The fraction of large random trees representing a given Boolean function in implicational logic”, Random Structures and Algorithms, vol. 40 (3), pp. 317-349, (Wiley) [Fournier 2012]
- A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler : “Probabilities of Boolean Functions Given by Random Implicational Formulas”, The Electronic Journal of Combinatorics, vol. 19 (2), pp. p37, (Open Journal Systems) [Genitrini 2012a]
- A. Genitrini, J. Kozik : “In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid”, Annals of Pure and Applied Logic, vol. 163 (7), pp. 875-887, (Elsevier Masson) [Genitrini 2012b]
- C. Pivoteau, B. Salvy, M. Soria : “Algorithms for combinatorial structures: Well-founded systems and Newton iterations.”, Journal of Combinatorial Theory, Series A, vol. 119 (8), pp. 1711-1773, (Elsevier) [Pivoteau 2012]
- J. Van Der Hoeven, G. Lecerf, B. Mourrain, Ph. Trébuchet, J. Berthomieu, D. Diatta, A. Mantzaflaris : “Mathemagix”, ACM Communications in Computer Algebra, vol. 45 (3/4), pp. 186-188, (Association for Computing Machinery (ACM)) [Van Der Hoeven 2012]
- X. Wang, M. Latapy, M. Soria : “Deciding on the type of the degree distribution of a graph from traceroute-like measurements”, International Journal of Computer Networks & Communications, vol. 4 (3), pp. 151-167, (AIRCC Publishing Corporation) [Wang 2012]