The following pages link to Elie de Panafieu (Q417986):
Displaying 19 items.
- Attribute-based encryption schemes with constant-size ciphertexts (Q417988) (← links)
- (Q727972) (redirect page) (← links)
- 2-Xor revisited: satisfiability and probabilities of functions (Q727973) (← links)
- Threshold functions for small subgraphs: an analytic approach (Q1689924) (← links)
- Phase transition of random non-uniform hypergraphs (Q2018538) (← links)
- Threshold functions for small subgraphs in simple graphs and multigraphs (Q2189830) (← links)
- Counting directed acyclic and elementary digraphs (Q2199812) (← links)
- Analytic description of the phase transition of inhomogeneous multigraphs (Q2346591) (← links)
- Enumeration and structure of inhomogeneous graphs (Q2803356) (← links)
- Complexity estimates for two uncoupling algorithms (Q2963220) (← links)
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (Q3084342) (← links)
- Counting connected graphs with large excess (Q5111023) (← links)
- Graphs with degree constraints (Q5194941) (← links)
- Combinatorics of nondeterministic walks of the Dyck and Motzkin type (Q5195225) (← links)
- Analytic combinatorics of connected graphs (Q5242884) (← links)
- Probabilities of 2-Xor Functions (Q5405064) (← links)
- Analytic Description of the Phase Transition of Inhomogeneous Multigraphs (Q5420005) (← links)
- The birth of the strong components (Q6119218) (← links)
- Exact enumeration of satisfiable 2-SAT formulae (Q6138912) (← links)
