Bibliography
Publications of the year
Doctoral Dissertations and Habilitation Theses
-
1S. Chen.
Quelques applications de l'algébre différentielle et aux différences pour le télescopage créatif, Ecole Polytechnique X, February 2011, This thesis is codirected between Ecole Polytechnique and Chinese Academy of Sciences.
http://hal. inria. fr/ pastel-00576861/ en -
2M. Mezzarobba.
Autour de l'évaluation numérique des fonctions D-finies, École polytechnique, Palaiseau, France, October 2011.
http://algo. inria. fr/ papers/ pdf/ these-mezzarobba-preliminaire. pdf
Articles in International Peer-Reviewed Journal
-
3L. Addario-Berry, N. Broutin.
Total progeny in killed branching random walk, in: Probability Theory and Related Fields, 2012.
http://arxiv. org/ abs/ 0908. 1083 -
4L. Addario-Berry, N. Broutin, C. Goldschmidt.
The continuum limit of critical random graphs, in: Probability Theory and Related Fields, 2012. [ DOI : 10.1007/s00440-010-0325-4 ]
http://arxiv. org/ abs/ 0903. 4730 -
5P. Blasiak, P. Flajolet.
Combinatorial models of creation-annihilation, in: Séminaire Lotharingien de Combinatoire, 2011, vol. 65, no B65c, p. 1–78.
http://www. emis. de/ journals/ SLC/ wpapers/ s65blafla. pdf -
6A. Bostan, S. Boukraa, S. Hassani, M. van Hoeij, J.-M. Maillard, J.-A. Weil, N. Zenine.
The Ising model: from elliptic curves to modular forms and Calabi-Yau equations, in: Journal of Physics A: Mathematical and Theoretical, 2011, vol. 44, no 4, 44pp p. [ DOI : 10.1088/1751-8113/44/4/045204 ]
http://arxiv. org/ abs/ 1007. 0535 -
7A. Bostan, M. Chowdhury, J. van der Hoeven, É. Schost.
Homotopy methods for multiplication modulo triangular sets, in: Journal of Symbolic Computation, 2011, vol. 46, no 12, p. 1378–1402.
http://dx. doi. org/ 10. 1016/ j. jsc. 2011. 08. 015 -
8A. Bostan, F. Chyzak, M. van Hoeij, L. Pech.
Explicit formula for the generating series of diagonal 3D rook paths, in: Séminaire Lotharingien de Combinatoire, 2011, vol. B66a, 27 pages.
http://www. emis. de/ journals/ SLC/ wpapers/ s66bochhope. html -
9A. Bostan, T. Combot.
A binomial-like matrix equation, in: American Mathematical Monthly, 2012. -
10N. Broutin, P. Flajolet.
The distribution of height and diameter in random non-plane binary trees, in: Random Structures and Algorithms, 2012.
http://arxiv. org/ abs/ 1009. 1515 -
11N. Broutin, C. Holmgren.
The total path length of split trees, in: The Annals of Applied Probability, 2012.
http://arxiv. org/ abs/ 1102. 2541 -
12J.-G. Dumas, L. Fousse, B. Salvy.
Simultaneous modular reduction and Kronecker substitution for small finite fields, in: Journal of Symbolic Computation, July 2011, vol. 46, no 7, p. 823–840.
http://dx. doi. org/ 10. 1016/ j. jsc. 2010. 08. 015
International Conferences with Proceedings
-
13N. Broutin, R. Neininger, H. Sulzbach.
Partial match queries in random quadtrees, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012.
http://arxiv. org/ abs/ 1107. 2231 -
14F. Chyzak, A. Darrasse.
Using Camlp4 for presenting dynamic mathematics on the web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the web, in: ICFP 2011 - 16th ACM SIGPLAN international conference on Functional programming, Tokyo, Japan, ACM, September 2011, p. 259-265. [ DOI : 10.1145/2034773.2034809 ]
http://hal. inria. fr/ hal-00640584/ en -
15F. Chyzak, J. Davenport, C. Koutschan, B. Salvy.
On Kahan's Rules for Determining Branch Cuts, in: SYNASC 2011. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing., Timisoara, Romania, IEEE Computer Society's Conference Publishing Services, 2011.
http://hal. inria. fr/ inria-00623044/ en -
16P. Flajolet, M. Pelletier, M. Soria.
On Buffon Machines and Numbers, in: SODA'11, San Francisco, United States, 2011, p. pp. 172–183, Largely revised version with references and figures added. 12 pages..
http://hal. inria. fr/ hal-00548904/ en
Internal Reports
-
17L. Addario-Berry, N. Broutin, C. Holmgren.
Cutting down trees with a Markov chainsaw, arXiv, 2011, Submitted.
http://arxiv. org/ abs/ 1110. 6455 -
18N. Broutin, L. Devroye, N. Fraiman, G. Lugosi.
Connectivity threshold for Bluetooth graphs, arXiv, 2011, Submitted.
http://arxiv. org/ abs/ 1103. 0351 -
19N. Broutin, O. Fawzi.
Longest distance in random circuits, arXiv, 2011, Submitted.
http://arxiv. org/ abs/ 1101. 5547 -
20N. Broutin, J.-F. Marckert.
Asymptotic of trees with a prescribed degree sequence and applications, arXiv, 2011, Submitted.
http://arxiv. org/ abs/ 1110. 5203 -
21C. Pivoteau, B. Salvy, M. Soria.
Algorithms for Combinatorial Systems, arXiv, 2011, 58 pages. Submitted.
http://arxiv. org/ abs/ 1109. 2688
Other Publications
-
22A. Bostan, F. Chyzak, Z. Li, B. Salvy.
Fast computation of common left multiples of linear ordinary differential operators, ACM, New York, NY, USA, July 2011, vol. 45, Poster at ISSAC 2011.
http://doi. acm. org/ 10. 1145/ 2016567. 2016581