Équipes actuelles :
ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL
LIP6
- 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, A. Genitrini, F. Peschanski : “Enumeration and Random Generation of Concurrent Computations”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 83-96, (Discrete Mathematics and Theoretical Computer Science) [Bodini 2012a]
- 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]
- A. Darrasse, K. Panagiotou, O. Roussel, M. Soria : “Biased Boltzmann samplers and generation of extended linear languages with shuffle”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 125-140, (Discrete Mathematics and Theoretical Computer Science) [Darrasse 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]
- Ah. Helmi, J. Lumbroso, C. Martínez, A. Viola : “Data Streams as Random Permutations: the Distinct Element Problem”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 323-338, (Discrete Mathematics and Theoretical Computer Science) [Helmi 2012]
- B. Morcrette, Hosam M. Mahmoud : “Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 219-232, (Discrete Mathematics and Theoretical Computer Science) [Morcrette 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]