Emmanuelle Anceaume
Emmanuelle Anceaume
Directrice de recherche du CNRS
25
Documents
Présentation
Emmanuelle Anceaume received her PhD in Computer Science from the University Paris-Orsay (Paris-XI) for my work on dependable systems. She spent a post-doctoral year at Cornell University (NY - USA) and worked with Sam Toueg on unreliable failure detectors. She is a CNRS researcher at IRISA-UMR6074 lab. Her current research group is the [INRIA](http://www.inria.fr/en/teams/cidre) / [IRISA](http://www.irisa.fr/recherche/rechAxes.html) CIDRE research team. She investigates dependability and security issues in large scale and dynamic systems. For the last few years, she has been working on data stream algorithms, privacy preserving reputation mechanisms, and consistency issues in large scale dynamic networks with sa deeper focus on blockchains.
Emmanuelle Anceaume received her PhD in Computer Science from the University Paris-Orsay (Paris-XI) for my work on dependable systems. She spent a post-doctoral year at Cornell University (NY - USA) and worked with Sam Toueg on unreliable failure detectors. She is a CNRS researcher at IRISA-UMR6074 lab. Her current research group is the [INRIA](http://www.inria.fr/en/teams/cidre) / [IRISA](http://www.irisa.fr/recherche/rechAxes.html) CIDRE research team. She investigates dependability and security issues in large scale and dynamic systems. For the last few years, she has been working on data stream algorithms, privacy preserving reputation mechanisms, and consistency issues in large scale dynamic networks with sa deeper focus on blockchains.
Domaines de recherche
Informatique [cs]
Algorithme et structure de données [cs.DS]
Publications
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 25
- 7
- 1
- 2
- 3
- 5
- 10
- 4
|
Balanced allocations and global clock in population protocols: An accurate analysisSIROCCO 2018 - 25th International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. p.296-311, ⟨10.1007/978-3-030-01325-7_26⟩
Communication dans un congrès
hal-01888301v1
|
|
Population Protocols with Convergence DetectionNCA 2018 - 17th IEEE International Symposium on Network Computing and Applications (NCA), Nov 2018, Boston, United States. pp.1-8, ⟨10.1109/NCA.2018.8548344⟩
Communication dans un congrès
hal-01849441v1
|
|
Probabilistic Analysis of Counting Protocols in Large-scale Asynchronous and Anonymous Systems2017 IEEE 16th International Symposium on Network Computing and Applications (NCA), Oct 2017, Cambridge, United States. ⟨10.1109/nca.2017.8171371⟩
Communication dans un congrès
hal-01580275v3
|
|
Optimal Proportion Computation with Population ProtocolsSymposium on Network Computing and Applications, IEEE, Oct 2016, Cambridge, United States. ⟨10.1109/nca.2016.7778621⟩
Communication dans un congrès
hal-01354352v2
|
|
Identifier des icebergs parmi des flux de données distribuésALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Communication dans un congrès
hal-01303873v1
|
|
Groupement de clés efficace pour un équilibrage de charge quasi-optimal dans les systèmes de traitement de fluxALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Communication dans un congrès
hal-01303887v1
|
|
Online Scheduling for Shuffle Grouping in Distributed Stream Processing Systems Research PaperACM/IFIP/USENIX Middleware 2016 , ACM/IFIP/USENIX, Dec 2016, Trento, Italy. ⟨10.1145/2988336.2988347⟩
Communication dans un congrès
hal-01397658v1
|
|
Analysis of the Propagation Time of a Rumour in Large-scale Distributed Systems2016 IEEE 15th International Symposium on Network Computing and Applications (NCA), Oct 2016, Cambridge, United States. ⟨10.1109/nca.2016.7778629⟩
Communication dans un congrès
hal-01354815v3
|
|
Counting with Population Protocols2015 IEEE 14th International Symposium on Network Computing and Applications, IEEE, Sep 2015, Cambridge, United States. pp.9, ⟨10.1109/nca.2015.35⟩
Communication dans un congrès
hal-01189596v1
|
|
Identifying Global Icebergs in Distributed Streams34th International Symposium on Reliable Distributed Systems (SRDS), Sep 2015, Montreal, Canada. pp.10, ⟨10.1109/SRDS.2015.19⟩
Communication dans un congrès
hal-01194511v1
|
|
Estimating the Frequency of Data Items in Massive Distributed StreamsIEEE 4th Symposium on Network Cloud Computing and Applications (NCCA), Jun 2015, Munich, Germany. pp.9, ⟨10.1109/ncca.2015.19⟩
Communication dans un congrès
hal-01194529v1
|
|
Efficient Key Grouping for Near-Optimal Load Balancing in Stream Processing SystemsThe 9th ACM International Conference on Distributed Event-Based Systems (DEBS), Jun 2015, Oslo, Norway. ⟨10.1145/2675743.2771827⟩
Communication dans un congrès
hal-01194518v1
|
|
Estimer la corrélation à la volée entre flux massifs est possible avec très peu de mémoireALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01147072v1
|
|
Deviation Estimation between Distributed Data Streams10th European Dependable Computing Conference (EDCC 2014), May 2014, Newcastle, United Kingdom. pp.35-45, ⟨10.1109/EDCC.2014.27⟩
Communication dans un congrès
hal-00998702v1
|
Byzantine-tolerant Uniform Node Sampling Service2017
Pré-publication, Document de travail
hal-01634363v1
|
|
|
New results on a generalized coupon collector problem using Markov chains2014
Pré-publication, Document de travail
hal-01005333v1
|
|
Proactive Online Scheduling for Shuffle Grouping in Distributed Stream Processing Systems[Research Report] LINA-University of Nantes; Sapienza Università di Roma (Italie). 2015
Rapport
hal-01246701v2
|
|
Identifying Global Icebergs in Distributed Streams[Research Report] Cnrs; Inria Rennes; Université de Nantes. 2015
Rapport
hal-01141829v1
|
|
Optimization results for a generalized coupon collector problem[Research Report] Inria Rennes; Cnrs. 2015
Rapport
hal-01141577v1
|
|
New results on a generalized coupon collector problem using Markov chains2014
Rapport
hal-00950161v1
|