{"id":2,"date":"2025-06-18T07:59:27","date_gmt":"2025-06-18T07:59:27","guid":{"rendered":"https:\/\/genitrini.perso.lip6.fr\/?page_id=2"},"modified":"2025-11-05T13:15:10","modified_gmt":"2025-11-05T13:15:10","slug":"sample-page","status":"publish","type":"page","link":"https:\/\/genitrini.perso.lip6.fr\/","title":{"rendered":"Antoine Genitrini"},"content":{"rendered":"\n<figure class=\"wp-block-image aligncenter size-large is-resized\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"604\" src=\"https:\/\/genitrini.perso.lip6.fr\/wp-content\/uploads\/2025\/11\/moi-1024x604.jpg\" alt=\"\" class=\"wp-image-34\" style=\"width:390px;height:auto\" srcset=\"https:\/\/genitrini.perso.lip6.fr\/wp-content\/uploads\/2025\/11\/moi-1024x604.jpg 1024w, https:\/\/genitrini.perso.lip6.fr\/wp-content\/uploads\/2025\/11\/moi-300x177.jpg 300w, https:\/\/genitrini.perso.lip6.fr\/wp-content\/uploads\/2025\/11\/moi-768x453.jpg 768w, https:\/\/genitrini.perso.lip6.fr\/wp-content\/uploads\/2025\/11\/moi-1536x906.jpg 1536w, https:\/\/genitrini.perso.lip6.fr\/wp-content\/uploads\/2025\/11\/moi-2048x1208.jpg 2048w\" sizes=\"auto, (max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n<p><!-- Paragraphe d\u2019introduction --><\/p>\n\n\n<p class=\"wp-block-paragraph\">Professor in Computer Science<br><br>Co-Head of <a href=\"https:\/\/sciences.sorbonne-universite.fr\/formation-sciences\/masters\/master-informatique\/parcours-stl\">STL specialization<\/a> of the Computer Science Master<br><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"has-text-align-left wp-block-paragraph\" style=\"font-size:clamp(0.875rem, 0.875rem + ((1vw - 0.2rem) * 0.588), 1.25rem);line-height:1.6\">\n    My chosen fields for research and teaching are in the context of the analysis of algorithms.\n    I usually use analytic combinatorics tools.\n  <\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"has-medium-font-size wp-block-paragraph\">Here you find some words on the subjects I am actually interested in:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li class=\"has-medium-font-size\">Concurrent programs have in the general case a complex control structure although many formalisms impose an acyclic control graph. We are interested in two related albeit distinct questions about such computation DAGs: the number of its computation paths and the uniform random generation of such paths. These questions are very difficult for general DAGs, and we thus study interesting subclasses.<\/li>\n\n\n\n<li class=\"has-medium-font-size\">Write a random boolean expression on given sets of boolean variables and of connectors: we obtain a boolean function. How random is this boolean function? E.g., what is the probability that we obtain a tautology? A literal? Any specified function? Is the probability of obtaining a given function related to the complexity of the function? Does the Shannon effect, i.e. the fact that &#8220;almost all&#8221; functions have maximal complexity, still hold for this probability distribution?<\/li>\n\n\n\n<li class=\"has-medium-font-size\">We are interested in two distinct types of structures: tree structures and their associated DAGs induced by sharing all the identical subtrees. Two classical questions arise in this context. Sample uniformly a large tree and compact it into a DAG: what is the typical size of the DAGs? This question is our main interest in the context of binary tries. Another approach deals directly with a class of compacted objects. Among all DAGs of the same size, what are the typical measures (e.g. the in or out-degree distribution, the profile&#8230;). What about the enumeration if we restrict to important subclasses of DAGs, like binary decision diagrams (an efficient way of representing boolean functions in practice) ?<\/li>\n\n\n\n<li class=\"has-medium-font-size\">From 2024 until 2027, with some of my collaborators, we are supported by the ANR and the FWF in the context of Directed Acyclic Graphs Analysis. Please, visit <a href=\"https:\/\/pandag.proj.lip6.fr\/\">the project website<\/a> to get more details!<\/li>\n<\/ul>\n\n\n<p><!-- Navigation + logos --><\/p>\n<\/div>\n<p><!-- \/wp:post-content --><\/p>","protected":false},"excerpt":{"rendered":"<p>Professor in Computer Science Co-Head of STL specialization of the Computer Science Master My chosen fields for research and teaching are in the context of the analysis of algorithms. I usually use analytic combinatorics tools. Here you find some words on the subjects I am actually interested in:<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-2","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=\/wp\/v2\/pages\/2","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2"}],"version-history":[{"count":10,"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=\/wp\/v2\/pages\/2\/revisions"}],"predecessor-version":[{"id":36,"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=\/wp\/v2\/pages\/2\/revisions\/36"}],"wp:attachment":[{"href":"https:\/\/genitrini.perso.lip6.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}