Elie de Panafieu

According to our database1, Elie de Panafieu authored at least 15 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Threshold functions for small subgraphs in simple graphs and multigraphs.
Eur. J. Comb., 2020

The birth of the strong components.
CoRR, 2020

Counting directed acyclic and elementary digraphs.
CoRR, 2020

2019
Analytic combinatorics of connected graphs.
Random Struct. Algorithms, 2019

Combinatorics of nondeterministic walks of the Dyck and Motzkin type.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics.
Proceedings of the 30th International Teletraffic Congress, 2018

2017
Threshold functions for small subgraphs: an analytic approach.
Electron. Notes Discret. Math., 2017

2016
2-Xor Revisited: Satisfiability and Probabilities of Functions.
Algorithmica, 2016

Graphs with degree constraints.
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015
Phase transition of random non-uniform hypergraphs.
J. Discrete Algorithms, 2015

Analytic description of the phase transition of inhomogeneous multigraphs.
Eur. J. Comb., 2015

2014
Probabilities of 2-Xor Functions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Complexity estimates for two uncoupling algorithms.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Attribute-based encryption schemes with constant-size ciphertexts.
Theor. Comput. Sci., 2012

2011
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts.
Proceedings of the Public Key Cryptography - PKC 2011, 2011


  Loading...