Michele Soria           

Principales publications et communications

 

A- Livres

 [BPSD07] A. Brygoo, , M. Pelletier, M. Soria and S. Dubuisson. Programmation et Algorithmique en VBA pour Excel.  Dunod Editeur, 2007, 240 p.

[BDPS06] A. Brygoo, R. Durand, M. Pelletier, and M. Soria. Compléments de cours Programmation Impérative .  Paracamplus Editeur, 2006,  160 p.

[BDPQS05] A. Brygoo, R. Durand, M. Pelletier, C. Queinnec, and M. Soria. Annales commentées de Programmation Récursive .  Paracamplus Editeur, 2005,  125 p.

[BDPQS04] A. Brygoo, R. Durand, M. Pelletier, C. Queinnec, and M. Soria. Programmation Récursive (en Scheme).  Dunod Editeur, 2004, 350 p.

 [SMBP97] M. Soria, M. Morcrette, A. Brygoo, and O. PaliŹs.  Initiation ą l'informatique ą travers Word et Excel.  Vuibert Editeur, 1997.  450 p.

 [FGS90] C. Froidevaux,  MC. Gaudel and M. Soria , Types de données et Algorithmes, Editions MacGrawHill , 1990,  575 p.

 

B- Articles de journaux internationaux, avec comité de lecture

 [DHS16] A Darrasse, HK. Hwang et M. Soria : Shape measures of Random Increasing k-trees, Combinatorics, Probability and Computing, CPC 2016, Vol. 25 no 05, p. 668--699

 [DS13] P. Duchon et M. Soria : Random Generation and Simulation, introduction for the Collected Work of Philippe Flajolet, Volume 6, chap 3, 2013.

 [PSS12] C. Pivoteau, B. Salvy et M. Soria : Algorithms for Combinatorial structures: well-founded systems and Newton iterations, Journal of Combinatorial Theory, series A, vol. 119, pp. 1711-1773, 2012.

 [BRS12] O. Bodini, O. Roussel, M. Soria, Boltzmann samplers for first order combinatorial differential equations, 17 pages, ą paraĒtre dans Discrete Applied Mathematics-2012

 [BFSS01] C. Banderier, Ph. Flajolet, G. Schaeffer, M. Soria, Random  maps, coalescing saddles, singularity analysis and Airy phenomena, Random Structures and Algorithms Vol 19. 3-4, pp. 194-246,  dec. 2001

[DS97] M. Drmota and M. Soria.  Images and preimages in random mapping.  SIAM Journal on Discrete Mathematics, 10, 1997.

[DS95] M. Drmota and M. Soria.  Marking in combinatorial constructions: Generating functions and  limiting distributions.  Theoretical Computer Science, 144(1-2):pp.67-99, June 1995.

[FS93] P. Flajolet and M. Soria.  General combinatorial schemas: Gaussian limit distributions and  exponential tails. Discrete. Mathematics, vol.114:pp.159-180, 1993.

[FS91] P. Flajolet and M. Soria.  The cycle construction. SIAM J. Discrete. Maths., vol.4(1): pp.58-60, February 1991.

[FS90] P. Flajolet and M. Soria.  Gaussian limiting distributions for the number of components in  combinatorial structures. J. Combinatorial Theory, Series A, vol 53:165-182, 1990.

[CKS89] C. Choppy, S. Kaplan, and M. Soria.  Complexity analysis of term rewriting systems.  Theoretical Computer Science, vol.67:pp.261-282, 1989.

 

C- Conférences et Workshop Internationaux avec comité de lecture

[S13] M. Soria  : Newton Iterations on Combinatorial Systems , AofA 2013, Keynote Lecture, Minorque, Espagne, June 2013.

[DPRS12] A. Darrasse, K. Panagiotou, O. Roussel and M. Soria  : Biased Boltzmann samplers and generation of extended linear languages with shuffle, AofA'12, DMTCS Proceedings, Montréal, Canada, pp. 1--12 , June 2012.

[FPS11] P. Flajolet, M. Pelletier and M. Soria : Buffon machines and numbers, Symposium on Discrete Algorithms, SODA11, San Francisco, Jan. 2011, 14p.

[DPRS10] A. Darrasse, K. Panagiotou, O. Roussel and M. Soria  : Boltzmann generation for regular languages with shuffle GASCOM 2010, Montréal, September 2010, 14p.

[WLS10] X. Wang, M. Latapy and M. Soria : Deciding on the type of a graph from a BFS,   CompleNet 2010, Rio de Janeiro, october 2010, 8p.

[DHBS10]A Darrasse HK. Hwang, O. Bodini et M. Soria : Profile of Random Increasing k-trees, Analytic Combinatorics and Algorithms, ANALCO’10, SIAM Proceedings, p. 99-111.

[RS09] O. Roussel and M. Soria : « Sampling of Ordered Structures», LAGOS09 Latin-American Algorithms, Graphs and Optimization Symposium, pp. 1-6, November 2009

[FPS09] P. Flajolet, M. Pelletier et M. Soria : On Buffon machines and numbers, International Conference on Analysis of Algorithms, (AofA 2009), Fréjus, France, 14p., June 2009

[DS09] A Darrasse and M. Soria : « Limiting Distribution for Distances in k-trees », IWOCA09 20th Internat. Workshop on Combinatorial Algorithms Hradec Moravic -Tch. Rep., pp. 1-12, July 2009

[MDBS09] A. Mougenot, A Darrasse, X. Blanc  and M. Soria : « Uniform random generation of huge metamodel instances », EMCDAA09 5th European Conference on Model-Driven Architecture Enschede, Holland, pp. 1-16, June 2009

[PSS08] C. Pivoteau, B. Salvy, M. Soria : «Boltzmann Oracle for Combinatorial Systems», Mathematics and Computer Science, DMTCS Proceedings, Blaubeuren, Germany, pp. 475-488, Sept. 2008

[S08] M. Soria : «Boltzmann sampling and properties of trees», Conference on Analysis of Algorithms     AofA08, Maresias, Brésil, Avr. 2008.

[BDS08] O. Bodini, A. Darrasse, M. Soria : «Distances in Random Apollonian Networks», FPSAC'08, DMTCS Proceedings, Valparaiso, Chile, pp. 307-18 , June 2008

[DS07] A Darrasse and M. Soria, « Distribution of degrees in RAN structures and Boltzmann generation of trees», AofA'07, DIMACS Series in DMTCS, Antibes, pp. 313-324, june 07.

 

 

Nouvelles technologies pour l’enseignement

[BDMQS02] A. Brygoo, R. Durand, P. Manoury, C. Queinnec, M. Soria Experiment about a training engine,. Proceedings IFIP WCC 2002 World Computer Congress, 16p. Aout 2002 Montréal

[BDMQS02-b] A. Brygoo, R. Durand, P. Manoury, C. Queinnec, M. Soria. Un cédérom pour Scheme: chacun son entraineur, un entraineur pour tous, Technologies de l’Information et de la Communication dans les Enseignements d’ingénieur et dans l’industrie, TICE 2002 , pp. 223-231, Nov 2002 Lyon