12 毕业博士 2002 - 2019

1997-2017 刊物

• 2017
  • N. Basset, J. Mairesse, M. Soria : “Uniform sampling for networks of automata”, CONCUR 2017 28^th International Conference on Concurrency Theory, Berlin, Germany (2017)
• 2016
  • M. Bousquet‑Mélou, R. Sedgewick, M. Soria : “Introduction for Special Issue AofA14”, Algorithmica, vol. 75, (Springer Verlag) (2016)
  • A. Darrasse, H.‑K. Hwang, M. Soria : “Shape Measures of Random Increasing k-trees”, Combinatorics, Probability and Computing, vol. 25, pp. 668-699, (Cambridge University Press (CUP)) (2016)
• 2013
  • M. Soria : “Combinatorial Systems and Newton iteration”, 24^th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA13, Cala Galdana, Menorca, Spain (2013)
• 2012
  • O. Bodini, O. Roussel, M. Soria : “Boltzmann samplers for first-order differential specifications”, Discrete Applied Mathematics, vol. 160 (18), pp. 2563-2572, (Elsevier) (2012)
  • 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) (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) (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, 23^rd 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) (2012)
• 2011
  • M. Soria : “Boltzmann Generation”, International Colloquium Philippe Flajolet and Analytic Combinatorics PFAC, Paris, France (2011)
  • B. Chauvin, B. Salvy, M. Soria, B. Vallee : “Philippe Flajolet, le fondateur de la combinatoire analytique”, Gazette des Mathématiciens, vol. 129, pp. 113-114, (Société Mathématique de France) (2011)
  • M. Soria : “Expressivité et complexité de la génération aléatoire de structures combinatoires sous modèle de Boltzmann”, Workshop ALEA, Marseille, France (2011)
  • B. Salvy, B. Sedgewick, M. Soria, W. Szpankowski, B. Vallee : “Philippe Flajolet, the Father of Analytic Combinatorics”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AO, 23^rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings, Reykjavik, Iceland, pp. 1-2, (Discrete Mathematics and Theoretical Computer Science) (2011)
  • Ph. Flajolet, M. Pelletier, M. Soria : “On Buffon Machines and Numbers”, SODA'11 - ACM/SIAM Symposium on Discrete Algorithms, San Francisco, United States, pp. 172-183, (Society for Industrial and Applied Mathematics) (2011)
• 2010
  • X. Wang, M. Latapy, M. Soria : “Deciding on the type of a graph from a BFS”, Workshop on Complex Networks CompleNet 2010, vol. 116, Communications in Computer and Information Science, Rio de Janeiro, Brazil, pp. 68-74, (Springer) (2010)
  • A. Darrasse, K. Panagiotou, O. Roussel, M. Soria : “Boltzmann generation for regular languages with shuffle”, GASCOM 2010 - Conference on random generation of combinatorial structures, Montréal, Canada (2010)
  • A. Darrasse, H.‑K. Hwang, O. Bodini, M. Soria : “The connectivity-profile of random increasing k-trees”, Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Austin, United States, pp. 99-106, (Society for Industrial and Applied Mathematics) (2010)
• 2009
  • O. Roussel, M. Soria : “Boltzmann sampling of ordered structures”, LAGOS 2009 - 5^th Latin-American Algorithms, Graphs and Optimization Symposium, vol. 35, Electronic Notes in Discrete Mathematics, Rio Grande do Sul, Brazil, pp. 305-310, (Elsevier) (2009)
  • A. Darrasse, M. Soria : “Limiting distribution for distances in k-trees”, 20^th International Workshop on Combinatorial Algorithms, IWOCA 2009, vol. 5874, Lecture Notes in Computer Science, Hradec nad Moravicí, Czechia, pp. 170-182 (2009)
  • A. Mougenot, A. Darrasse, X. Blanc, M. Soria : “Uniform random generation of huge metamodel instances”, Fifth European Conference on Model-Driven Architecture Foundations and Applications (ECMDA-FA 2009), Enschede, Netherlands, pp. 130-145 (2009)
• 2008
  • C. Pivoteau, B. Salvy, M. Soria : “Boltzmann Oracle for Combinatorial Systems”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, DMTCS Proceedings, Blaubeuren, Germany, pp. 475-488, (Discrete Mathematics & Theoretical Computer Science) (2008)
  • O. Bodini, A. Darrasse, M. Soria : “Distances in random Apollonian network structures”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AJ, 20^th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), DMTCS Proceedings, Viña del Mar, Chile, pp. 307-318, (Discrete Mathematics and Theoretical Computer Science) (2008)
• 2007
  • A. Darrasse, M. Soria : “Degree distribution of random Apollonian network structures and Boltzmann sampling”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), DMTCS Proceedings, Juan les Pins, France, pp. 313-324, (Discrete Mathematics and Theoretical Computer Science) (2007)
  • A. Brygoo, M. Pelletier, M. Soria, S. Dubuisson : “Programmation et algorithmique en VBA pour Excel”, (Dunod), (ISBN: 978-2-100-507993) (2007)
• 2006
  • A. Brygoo, T. Durand, M. Pelletier, Ch. Queinnec, M. Soria : “Programmation récursive - annales corrigées, novembre 2001-septembre 2005”, (Paracamplus, Paris, France), (ISBN: 2916466002) (2006)
• 2004
  • A. Brygoo, T. Durand, M. Pelletier, Ch. Queinnec, M. Soria : “Programmation Récursive (en Scheme)”, (Dunod), (ISBN: 978-2-10-007479-2) (2004)
• 2002
  • A. Brygoo, T. Durand, P. Manoury, Ch. Queinnec, M. Soria : “Un cédérom pour Scheme: Chacun son entraineur, un entraineur pour tous”, TICE 2002 - Technologies de l'Information et de la Communication dans les Enseignements d'ingénieurs et dans l'industrie, Villeurbanne, France, pp. 223-231, (Institut National des Sciences Appliquées de Lyon) (2002)
  • A. Brygoo, T. Durand, P. Manoury, Ch. Queinnec, M. Soria : “Experiment around a training engine”, IFIP WCC 2002 - 17^th World Computer Congress, vol. 102, IFIP - The International Federation for Information Processing, Montreal, Canada, pp. 45-52, (Springer) (2002)
• 2001
  • 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, (Wiley) (2001)
• 2000
  • C. Banderier, Ph. Flajolet, G. Schaeffer, M. Soria : “Planar maps and Airy phenomena”, International Colloquium on Automata, Languages, & Programming - ICALP'2000, vol. 1853, Lecture Notes in Computer Science, Genève, Switzerland, pp. 388-402, (Springer) (2000)
  • M. Soria : “Singularity Composition Schemas”, 6^th Seminar on the Analysis of Algorithms, Krynica Morska, Poland (2000)
• 1998
  • M. Soria : “Coefficients of algebraic functions”, Inria Algorithms Seminar, Rocquencourt, France (1998)
  • M. Soria : “Explicit formulae for Coefficients of Algebraic Generating Functions”, GDR AMI-ALEA, Caen, France (1998)
  • M. Soria : “Special Limit Distributions”, Meeting on Analysis of Algorithms, Princeton, United States (1998)
• 1997
  • Ph. Flajolet, H.‑K. Hwang, M. Soria : “The ubiquitous Gaussian law in analytic combinatorics”, Random Structures and Algorithms Conference, Poznan, Poland (1997)
  • M. Drmota, M. Soria : “Images and preimages in random mapping”, SIAM Journal on Discrete Mathematics, vol. 10, pp. 246-269, (Society for Industrial and Applied Mathematics) (1997)
  • M. Soria, M. Morcrette, A. Brygoo, O. Paliès : “Initiation à la programmation par Word et Excel - Principes et macros”, 450 pages, (ITP-Vuibert) (1997)