![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Elie de Panafieu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Sergey Dovgal, Élie de Panafieu
, Dimbinaina Ralaivaosaona
, Vonjy Rasendrahasina, Stephan G. Wagner:
The birth of the strong components. Random Struct. Algorithms 64(2): 170-266 (2024) - [c10]Eva-Maria Hainzl, Élie de Panafieu:
Tree Walks and the Spectrum of Random Graphs. AofA 2024: 11:1-11:15 - [c9]Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. ICALP 2024: 43:1-43:18 - [i10]Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta:
Robot Positioning Using Torus Packing for Multisets. CoRR abs/2404.09981 (2024) - 2023
- [i9]Élie de Panafieu, Michael Wallner
:
Combinatorics of nondeterministic walks. CoRR abs/2311.03234 (2023) - 2021
- [c8]Quentin Lutz, Elie de Panafieu, Maya Stein, Alex Scott:
Active clustering for labeling training data. NeurIPS 2021: 8469-8480 - [i8]Sergey Dovgal, Élie de Panafieu, Vlady Ravelomanana:
Exact enumeration of satisfiable 2-SAT formulae. CoRR abs/2108.08067 (2021) - [i7]Quentin Lutz, Élie de Panafieu, Alex Scott, Maya Stein:
Active clustering for labeling training data. CoRR abs/2110.14521 (2021) - 2020
- [j7]Gwendal Collet, Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana:
Threshold functions for small subgraphs in simple graphs and multigraphs. Eur. J. Comb. 88: 103113 (2020) - [i6]Élie de Panafieu, Sergey Dovgal:
Counting directed acyclic and elementary digraphs. CoRR abs/2001.08659 (2020) - [i5]Élie de Panafieu, Sergey Dovgal, Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, Stephan G. Wagner:
The birth of the strong components. CoRR abs/2009.12127 (2020)
2010 – 2019
- 2019
- [j6]Elie de Panafieu:
Analytic combinatorics of connected graphs. Random Struct. Algorithms 55(2): 427-495 (2019) - [c7]Elie de Panafieu, Mohamed Lamine Lamali, Michael Wallner:
Combinatorics of nondeterministic walks of the Dyck and Motzkin type. ANALCO 2019: 1-12 - 2018
- [c6]Anne Bouillard, Céline Comte, Elie de Panafieu, Fabien Mathieu:
Of Kernels and Queues: When Network Calculus Meets Analytic Combinatorics. ITC (2) 2018: 49-54 - [i4]Anne Bouillard, Céline Comte, Elie de Panafieu, Fabien Mathieu:
Of Kernels and Queues: when network calculus meets analytic combinatorics. CoRR abs/1810.04875 (2018) - [i3]Elie de Panafieu, Mohamed Lamine Lamali, Michael Wallner
:
Combinatorics of nondeterministic walks of the Dyck and Motzkin type. CoRR abs/1812.06650 (2018) - 2017
- [j5]Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger
, Vlady Ravelomanana:
Threshold functions for small subgraphs: an analytic approach. Electron. Notes Discret. Math. 61: 271-277 (2017) - 2016
- [j4]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger
, Markus Kuba:
2-Xor Revisited: Satisfiability and Probabilities of Functions. Algorithmica 76(4): 1035-1076 (2016) - [c5]Elie de Panafieu, Lander Ramos:
Graphs with degree constraints. ANALCO 2016: 34-45 - [i2]Elie de Panafieu:
Analytic combinatorics of connected graphs. CoRR abs/1605.08597 (2016) - 2015
- [j3]Elie de Panafieu, Vlady Ravelomanana:
Analytic description of the phase transition of inhomogeneous multigraphs. Eur. J. Comb. 48: 186-197 (2015) - [j2]Elie de Panafieu:
Phase transition of random non-uniform hypergraphs. J. Discrete Algorithms 31: 26-39 (2015) - 2014
- [c4]Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger
, Markus Kuba:
Probabilities of 2-Xor Functions. LATIN 2014: 454-465 - 2013
- [c3]Alin Bostan, Frédéric Chyzak, Elie de Panafieu:
Complexity estimates for two uncoupling algorithms. ISSAC 2013: 85-92 - [c2]Elie de Panafieu:
Phase Transition of Random Non-uniform Hypergraphs. IWOCA 2013: 127-139 - [i1]Alin Bostan, Frédéric Chyzak, Elie de Panafieu:
Complexity Estimates for Two Uncoupling Algorithms. CoRR abs/1301.5414 (2013) - 2012
- [j1]Nuttapong Attrapadung
, Javier Herranz
, Fabien Laguillaumie, Benoît Libert, Elie de Panafieu, Carla Ràfols
:
Attribute-based encryption schemes with constant-size ciphertexts. Theor. Comput. Sci. 422: 15-38 (2012) - 2011
- [c1]Nuttapong Attrapadung, Benoît Libert, Elie de Panafieu:
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts. Public Key Cryptography 2011: 90-108
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint