Suivre
Elie de Panafieu
Elie de Panafieu
Bell Labs France, Nokia
Adresse e-mail validée de nokia-bell-labs.com - Page d'accueil
Titre
Citée par
Citée par
Année
Expressive key-policy attribute-based encryption with constant-size ciphertexts
N Attrapadung, B Libert, E De Panafieu
International Workshop on Public Key Cryptography, 90-108, 2011
4922011
Attribute-based encryption schemes with constant-size ciphertexts
N Attrapadung, J Herranz, F Laguillaumie, B Libert, E De Panafieu, ...
Theoretical computer science 422, 15-38, 2012
2432012
Complexity estimates for two uncoupling algorithms
A Bostan, F Chyzak, É De Panafieu
Proceedings of the 38th International Symposium on Symbolic and Algebraic …, 2013
402013
Phase transition of random non-uniform hypergraphs
É de Panafieu
Journal of Discrete Algorithms 31, 26-39, 2015
222015
Symbolic method and directed graph enumeration
É de Panafieu, S Dovgal
arXiv preprint arXiv:1903.09454, 2019
172019
Analytic combinatorics of connected graphs
É Panafieu
Random Structures & Algorithms 55 (2), 427-495, 2019
122019
Graphs with degree constraints
É de Panafieu, L Ramos
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and …, 2016
122016
Combinatorics of nondeterministic walks of the Dyck and Motzkin type
É Panafieu, ML Lamali, M Wallner
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and …, 2019
72019
Analytic description of the phase transition of inhomogeneous multigraphs
É de Panafieu, V Ravelomanana
European Journal of Combinatorics 48, 186-197, 2015
72015
Active clustering for labeling training data
Q Lutz, É de Panafieu, M Stein, A Scott
Advances in Neural Information Processing Systems 34, 8469-8480, 2021
52021
Active clustering for labeling training data
Q Lutz, É de Panafieu, A Scott, M Stein
arXiv preprint arXiv:2110.14521, 2021
52021
Counting directed acyclic and elementary digraphs
É de Panafieu, S Dovgal
arXiv preprint arXiv:2001.08659, 2020
52020
Threshold functions for small subgraphs in simple graphs and multigraphs
G Collet, É de Panafieu, D Gardy, B Gittenberger, V Ravelomanana
arXiv preprint arXiv:1807.05772, 2018
52018
Analytic Combinatorics of Graphs, Hypergraphs and Inhomogeneous Graphs
E de Panafieu
PhD thesis, Université Paris-Diderot, Sorbonne Paris-Cité, 2014
52014
Of Kernels and Queues: when network calculus meets analytic combinatorics
A Bouillard, C Comte, É De Panafieu, F Mathieu
2018 30th International Teletraffic Congress (ITC 30) 2, 49-54, 2018
42018
Threshold functions for small subgraphs: an analytic approach
G Collet, É de Panafieu, D Gardy, B Gittenberger, V Ravelomanana
Electronic Notes in Discrete Mathematics 61, 271-277, 2017
42017
Enumeration and structure of inhomogeneous graphs
É De Panafieu
Discrete Mathematics & Theoretical Computer Science, 2015
42015
Probabilities of 2-xor functions
É De Panafieu, D Gardy, B Gittenberger, M Kuba
Latin American Symposium on Theoretical Informatics, 454-465, 2014
42014
The birth of the strong components
É de Panafieu, S Dovgal, D Ralaivaosaona, V Rasendrahasina, ...
arXiv preprint arXiv:2009.12127, 2020
3*2020
2-Xor revisited: satisfiability and probabilities of functions
E de Panafieu, D Gardy, B Gittenberger, M Kuba
Algorithmica 76 (4), 1035-1076, 2016
32016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20