logo EDITE Matthieu DIEN
Identité
Matthieu DIEN
État académique
Thèse soutenue le 2017-09-22
Sujet: Analyse de programmes concurrents via des outils de combinatoire analytique et de théorie des ordres.
Direction de thèse:
Encadrement de thèse:
Laboratoire:
Voisinage
Ellipse bleue: doctorant, ellipse jaune: docteur, rectangle vert: permanent, rectangle jaune: HDR. Trait vert: encadrant de thèse, trait bleu: directeur de thèse, pointillé: jury d'évaluation à mi-parcours ou jury de thèse.
Productions scientifiques
oai:hal.archives-ouvertes.fr:hal-01331227
Increasing Diamonds
International audience
12th. Latin American Theoretical INformatics Symposium http://hal.upmc.fr/hal-01331227 12th. Latin American Theoretical INformatics Symposium, Apr 2016, Ensenada, Mexico. <10.1007/978-3-662-49529-2_16>ARRAY(0x7f5470b8b858) 2016-04
oai:hal.upmc.fr:hal-01448695
The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
International audience
In this paper, we study two operators for composing combinatorial classes: the ordered product and its dual, the colored product. These operators have a natural interpretation in terms of Analytic Combinatorics, in relation with combinations of Borel and Laplace transforms. Based on these new constructions, we exhibit a set of transfer theorems and closure properties. We also illustrate the use of these operators to specify increasingly labeled structures tightly related to Series-Parallel constructions and concurrent processes. In particular, we provide a quantitative analysis of Fork/Join (FJ) parallel processes, a particularly expressive example of such a class.
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) 14th Workshop on Analytic Algorithmics and Combinatorics (ANALCO17) http://hal.upmc.fr/hal-01448695 14th Workshop on Analytic Algorithmics and Combinatorics (ANALCO17), Jan 2017, Barcelone, Spain. 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.16 - 30, 2017, <10.1137/1.9781611974775.2>ARRAY(0x7f5470e28040) 2017-01-16
oai:hal.upmc.fr:hal-01476189
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets
International audience
In this paper, we introduce a uniform random sampler for linear extensions of Series-Parallel posets. The algorithms we present ensure an essential property of random generation algorithms: entropy. They are in a sense optimal in their consumption of random bits.
Computer Science Symposium in Russia Computer Science Symposium in Russia http://hal.upmc.fr/hal-01476189 Computer Science Symposium in Russia, 2017, Kazan, Russia. Computer Science Symposium in RussiaARRAY(0x7f5470de4608) 2017
Soutenance
Thèse: Processus concurrents et combinatoire des structures croissantes : analyse quantitative et algorithmes de génération aléatoire
Soutenance: 2017-09-22
Rapporteurs: Cyril NICAUD    Alain DENISE