Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts. - Nuttapong Attrapadung; Benoît Libert; Elie de Panafieu (Public Key Cryptography, 2011)

Attribute-based encryption schemes with constant-size ciphertexts. - Nuttapong Attrapadung; Javier Herranz; Fabien Laguillaumie; Benoît Libert; Elie de Panafieu; Carla Ràfols (Theor. Comput. Sci., 2012)

Complexity estimates for two uncoupling algorithms. - Alin Bostan; Frédéric Chyzak; Elie de Panafieu (ISSAC, 2013)

Probabilities of 2-Xor Functions. - Elie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Markus Kuba (LATIN, 2014)

Analytic description of the phase transition of inhomogeneous multigraphs. - Elie de Panafieu; Vlady Ravelomanana (Eur. J. Comb., 2015)

Phase transition of random non-uniform hypergraphs. - Elie de Panafieu (J. Discrete Algorithms, 2015)

Graphs with degree constraints. - Elie de Panafieu; Lander Ramos (ANALCO, 2016)

2-Xor Revisited: Satisfiability and Probabilities of Functions. - Elie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Markus Kuba (Algorithmica, 2016)

Threshold functions for small subgraphs: an analytic approach. - Gwendal Collet; Elie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Vlady Ravelomanana (Electron. Notes Discret. Math., 2017)

Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics. - Anne Bouillard; Céline Comte; Elie de Panafieu; Fabien Mathieu (ITC (2), 2018)

Combinatorics of nondeterministic walks of the Dyck and Motzkin type. - Elie de Panafieu; Mohamed Lamine Lamali; Michael Wallner 001 (ANALCO, 2019)

Analytic combinatorics of connected graphs. - Elie de Panafieu (Random Struct. Algorithms, 2019)

Counting directed acyclic and elementary digraphs. - Élie de Panafieu; Sergey Dovgal (CoRR, 2020)

Threshold functions for small subgraphs in simple graphs and multigraphs. - Gwendal Collet; Élie de Panafieu; Danièle Gardy; Bernhard Gittenberger; Vlady Ravelomanana (Eur. J. Comb., 2020)

Active clustering for labeling training data. - Quentin Lutz; Elie de Panafieu; Maya Stein; Alex Scott 001 (NeurIPS, 2021)

Exact enumeration of satisfiable 2-SAT formulae. - Sergey Dovgal; Élie de Panafieu; Vlady Ravelomanana (Comb. Theory, 2023)

Combinatorics of nondeterministic walks. - Élie de Panafieu; Michael Wallner 001 (CoRR, 2023)

Tree Walks and the Spectrum of Random Graphs. - Eva-Maria Hainzl; Élie de Panafieu (AofA, 2024)

Robot Positioning Using Torus Packing for Multisets. - Chung Shue Chen; Peter Keevash; Sean Kennedy; Élie de Panafieu; Adrian Vetta (ICALP, 2024)

The birth of the strong components. - Sergey Dovgal; Élie de Panafieu; Dimbinaina Ralaivaosaona; Vonjy Rasendrahasina; Stephan G. Wagner (Random Struct. Algorithms, 2024)

torus packing for multisets. - Élie de Panafieu (DROPS Artifacts, 2024)

Probability of a Condorcet Winner for Large Electorates: An Analytic Combinatorics Approach. - Emma Caizergues; François Durand; Marc Noy; Élie de Panafieu; Vlady Ravelomanana (CoRR, 2025)