Atomic broadcast in one phase. - Pascale Minet; Emmanuelle Anceaume (ACM SIGOPS European Workshop, 1990)

A Lightweight Solution to Uniform Atomic Broadcast for Asynchronous Systems. - Emmanuelle Anceaume (FTCS, 1997)

HADES: A Middleware Support for Distributed Safety-Critical Real-Time Applications. - Emmanuelle Anceaume; Gilbert Cabillic; Pascal Chevochot; Isabelle Puaut (ICDCS, 1998)

On the correctness of multimedia applications. - Erwan Demairy; Emmanuelle Anceaume; Valérie Issarny (ECRTS, 1999)

A Flexible Run-time Support for Distributed Dependable Hard Real-time Applications. - Emmanuelle Anceaume; Gilbert Cabillic; Pascal Chevochot; Isabelle Puaut (ISORC, 1999)

Deadline-Constrained Causal Order. - Luís E. T. Rodrigues; Roberto Baldoni; Emmanuelle Anceaume; Michel Raynal (ISORC, 2000)

Avoiding Priority Inversion on the Processing of Requests by Active Replicated Servers. - Yun Wang; Francisco Vilar Brasileiro; Emmanuelle Anceaume; Fabíola Greve; Michel Hurfin (DSN, 2001)

An Efficient Solution to the k-Set Agreement Problem. - Emmanuelle Anceaume; Michel Hurfin; Philippe Raipin Parvédy (EDCC, 2002)

Unreliable Distributed Timing Scrutinizer: Adapting Asynchronous Algorithms to the Environment. - Emmanuelle Anceaume; Eric Mourgaya (Symposium on Object-Oriented Real-Time Distributed Computing, 2002)

Converging toward Decision Conditions. - Emmanuelle Anceaume; Eric Mourgaya; Philippe Raipin Parvédy (OPODIS, 2002)

Publish/subscribe scheme for mobile networks. - Emmanuelle Anceaume; Ajoy Kumar Datta; Maria Gradinariu; Gwendal Simon (POMC, 2002)

Tracking immediate predecessors in distributed computations. - Emmanuelle Anceaume; Jean-Michel Hélary; Michel Raynal (SPAA, 2002)

Efficient Solution to Uniform Atomic Broadcast. - Emmanuelle Anceaume (Int. J. Found. Comput. Sci., 2002)

A Note on the Determination of the Immediate Predecessors in a Distributed Computation. - Emmanuelle Anceaume; Jean-Michel Hélary; Michel Raynal (Int. J. Found. Comput. Sci., 2002)

Solving the Group Priority Inversion Problem in a Timed Asynchronous System. - Yun Wang; Emmanuelle Anceaume; Francisco Vilar Brasileiro; Fabíola Greve; Michel Hurfin (IEEE Trans. Computers, 2002)

An Architecture for Dynamic Scalable Self-Managed Persistent Objects. - Emmanuelle Anceaume; Roy Friedman; Maria Gradinariu; Matthieu Roy (CoopIS/DOA/ODBASE (2), 2004)

Designing Modular Services in the Scattered Byzantine Failure Model. - Emmanuelle Anceaume; Carole Delporte-Gallet; Hugues Fauconnier; Michel Hurfin; Gérard Le Lann (ISPDC/HeteroPar, 2004)

A necessary and sufficient condition for transforming limited accuracy failure detectors. - Emmanuelle Anceaume; Antonio Fernández 001; Achour Mostéfaoui; Gil Neiger; Michel Raynal (J. Comput. Syst. Sci., 2004)

P2P Architecture for Self-Atomic Memory. - Emmanuelle Anceaume; Maria Gradinariu; Vincent Gramoli; Antonino Virgillito (ISPAN, 2005)

Incentives for P2P Fair Resource Sharing. - Emmanuelle Anceaume; Maria Gradinariu; Aina Ravoaja (Peer-to-Peer Computing, 2005)

Towards a Theory of Self-organization. - Emmanuelle Anceaume; Xavier Défago; Maria Gradinariu; Matthieu Roy (DISC, 2005)

A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe. - Emmanuelle Anceaume; Maria Gradinariu; Ajoy Kumar Datta; Gwendal Simon; Antonino Virgillito (ICDCS, 2006)

Incentive-Based Robust Reputation Mechanism for P2P Services. - Emmanuelle Anceaume; Aina Ravoaja (OPODIS, 2006)

Clock Synchronization in the Byzantine-Recovery Failure Model. - Emmanuelle Anceaume; Carole Delporte-Gallet; Hugues Fauconnier; Michel Hurfin; Josef Widder (OPODIS, 2007)

SQUARE: scalable quorum-based atomic memory with local reconfiguration. - Vincent Gramoli; Emmanuelle Anceaume; Antonino Virgillito (SAC, 2007)

STORM: A Secure Overlay for P2P Reputation Management. - Aina Ravoaja; Emmanuelle Anceaume (SASO, 2007)

Managed Agreement: Generalizing two fundamental distributed agreement problems. - Emmanuelle Anceaume; Roy Friedman; Maria Gradinariu (Inf. Process. Lett., 2007)

PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn. - Emmanuelle Anceaume; Romaric Ludinard; Aina Ravoaja; Francisco Vilar Brasileiro (SASO, 2008)

Unreliable Distributed Timing Scrutinizer to Converge toward Decision Conditions. - Emmanuelle Anceaume; Eric Mourgaya; Philippe Raipin Parvédy (Stud. Inform. Univ., 2008)

Analytical Study of Adversarial Strategies in Cluster-based Overlays. - Emmanuelle Anceaume; Francisco V. Brasileiro; Romaric Ludinard; Bruno Sericola; Frédéric Tronel (PDCAT, 2009)

Brief Announcement: Induced Churn to Face Adversarial Behavior in Peer-to-Peer Systems. - Emmanuelle Anceaume; Francisco Vilar Brasileiro; Romaric Ludinard; Bruno Sericola; Frederic Tronel (SSS, 2009)

Exploiting Rateless Coding in Structured Overlays to Achieve Data Persistence. - Heverson Borba Ribeiro; Emmanuelle Anceaume (AINA, 2010)

Analytic Study of the Impact of Churn in Cluster-Based Structured P2P Overlays. - Emmanuelle Anceaume; Romaric Ludinard; Bruno Sericola (ICC, 2010)

Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes. - Emmanuelle Anceaume; Yann Busnel; Sébastien Gambs (OPODIS, 2010)

DataCube: A P2P Persistent Data Storage Architecture Based on Hybrid Redundancy Schema. - Heverson Borba Ribeiro; Emmanuelle Anceaume (PDP, 2010)

A Comparative Study of Rateless Codes for P2P Persistent Storage. - Heverson Borba Ribeiro; Emmanuelle Anceaume (SSS, 2010)

A framework for proving the self-organization of dynamic systems - Emmanuelle Anceaume; Xavier Défago; Maria Potop-Butucaru; Matthieu Roy (CoRR, 2010)

Characterizing the Adversarial Power in Uniform and Ergodic Node Sampling. - Emmanuelle Anceaume; Yann Busnel; Sébastien Gambs (AlMoDEP, 2011)

From SSIR to CIDre: A New Security Research Group in Rennes, France. - Emmanuelle Anceaume; Christophe Bidan; Sébastien Gambs; Guillaume Hiet; Michel Hurfin; Ludovic Mé; Guillaume Piolle; Nicolas Prigent; Eric Totel; Frederic Tronel; Valérie Viet Triem Tong (SysSec@DIMVA, 2011)

Modeling and evaluating targeted attacks in large scale dynamic systems. - Emmanuelle Anceaume; Bruno Sericola; Romaric Ludinard; Frederic Tronel (DSN, 2011)

Dependability Evaluation of Cluster-Based Distributed Systems. - Emmanuelle Anceaume; Francisco Vilar Brasileiro; Romaric Ludinard; Bruno Sericola; Frédéric Tronel (Int. J. Found. Comput. Sci., 2011)

AMORES: an architecture for mobiquitous resilient systems. - Christian Artigues; Yves Deswarte; Jérémie Guiochet; Marie-José Huguet; Marc-Olivier Killijian; David Powell; Matthieu Roy; Christophe Bidan; Nicolas Prigent; Emmanuelle Anceaume; Sébastien Gambs; Gilles Guette; et al. (ARMOR, 2012)

AnKLe: Detecting Attacks in Large Scale Systems via Information Divergence. - Emmanuelle Anceaume; Yann Busnel; Sébastien Gambs (EDCC, 2012)

An Information Divergence Estimation over Data Streams. - Emmanuelle Anceaume; Yann Busnel (NCA, 2012)

FixMe: A Self-organizing Isolated Anomaly Detection Architecture for Large Scale Distributed Systems. - Emmanuelle Anceaume; Erwan Le Merrer; Romaric Ludinard; Bruno Sericola; Gilles Straub (OPODIS, 2012)

Sketch star-metric: Comparing Data Streams via Sketching - Emmanuelle Anceaume; Yann Busnel (CoRR, 2012)

Performance evaluation of large-scale dynamic systems. - Emmanuelle Anceaume; Romaric Ludinard; Bruno Sericola (SIGMETRICS Perform. Evaluation Rev., 2012)

Uniform node sampling service robust against collusions of malicious nodes. - Emmanuelle Anceaume; Yann Busnel; Bruno Sericola (DSN, 2013)

A privacy preserving distributed reputation mechanism. - Emmanuelle Anceaume; Gilles Guette; Paul Lajoie-Mazenc; Nicolas Prigent; Valérie Viet Triem Tong (ICC, 2013)

Sketch *-Metric: Comparing Data Streams via Sketching. - Emmanuelle Anceaume; Yann Busnel (NCA, 2013)

Extending Signatures of Reputation. - Emmanuelle Anceaume; Gilles Guette; Paul Lajoie-Mazenc; Thomas Sirvent; Valérie Viet Triem Tong (Privacy and Identity Management, 2013)

On the Power of the Adversary to Solve the Node Sampling Problem. - Emmanuelle Anceaume; Yann Busnel; Sébastien Gambs (Trans. Large Scale Data Knowl. Centered Syst., 2013)

Anomaly Characterization in Large Scale Networks. - Emmanuelle Anceaume; Yann Busnel; Erwan Le Merrer; Romaric Ludinard; Jean Louis Marchand; Bruno Sericola (DSN, 2014)

Deviation Estimation between Distributed Data Streams. - Emmanuelle Anceaume; Yann Busnel (EDCC, 2014)

A Secure Two-Phase Data Deduplication Scheme. - Pierre Meye; Philippe Raipin Parvédy; Frédéric Tronel; Emmanuelle Anceaume (HPCC/CSS/ICESS, 2014)

Mistore: A distributed storage system leveraging the DSL infrastructure of an ISP. - Pierre Meye; Philippe Raipin Parvédy; Frederic Tronel; Emmanuelle Anceaume (HPCS, 2014)

Analysis of a large number of Markov chains competing for transitions. - Emmanuelle Anceaume; François Castella; Bruno Sericola (Int. J. Syst. Sci., 2014)

A Distributed Information Divergence Estimation over Data Streams. - Emmanuelle Anceaume; Yann Busnel (IEEE Trans. Parallel Distributed Syst., 2014)

Efficient key grouping for near-optimal load balancing in stream processing systems. - Nicolo Rivetti; Leonardo Querzoni; Emmanuelle Anceaume; Yann Busnel; Bruno Sericola (DEBS, 2015)

Privacy-Preserving Reputation Mechanism: A Usable Solution Handling Negative Ratings. - Paul Lajoie-Mazenc; Emmanuelle Anceaume; Gilles Guette; Thomas Sirvent; Valérie Viet Triem Tong (IFIPTM, 2015)

Reputation for Inter-Domain QoS Routing. - Emmanuelle Anceaume; Yann Busnel; Paul Lajoie-Mazenc; Géraldine Texier (NCA, 2015)

A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object. - Emmanuelle Anceaume; François Castella; Achour Mostéfaoui; Bruno Sericola (NCA, 2015)

Counting with Population Protocols. - Yves Mocquard; Emmanuelle Anceaume; James Aspnes; Yann Busnel; Bruno Sericola (NCA, 2015)

Estimating the Frequency of Data Items in Massive Distributed Streams. - Emmanuelle Anceaume; Yann Busnel; Nicolo Rivetti (NCCA, 2015)

Identifying Global Icebergs in Distributed Streams. - Emmanuelle Anceaume; Yann Busnel; Nicolo Rivetti; Bruno Sericola (SRDS, 2015)

New Results on a Generalized Coupon Collector Problem Using Markov Chains. - Emmanuelle Anceaume; Yann Busnel; Bruno Sericola (J. Appl. Probab., 2015)

Online Scheduling for Shuffle Grouping in Distributed Stream Processing Systems. - Nicolo Rivetti; Emmanuelle Anceaume; Yann Busnel; Leonardo Querzoni; Bruno Sericola (Middleware, 2016)

Safety analysis of Bitcoin improvement proposals. - Emmanuelle Anceaume; Thibaut Lajoie-Mazenc; Romaric Ludinard; Bruno Sericola (NCA, 2016)

Optimal proportion computation with population protocols. - Yves Mocquard; Emmanuelle Anceaume; Bruno Sericola (NCA, 2016)

Analysis of the propagation time of a rumour in large-scale distributed systems. - Yves Mocquard; Bruno Sericola; Samantha Robert; Emmanuelle Anceaume (NCA, 2016)

Optimization results for a generalized coupon collector problem. - Emmanuelle Anceaume; Yann Busnel; Ernst Schulte-Geers; Bruno Sericola (J. Appl. Probab., 2016)

Probabilistic analysis of counting protocols in large-scale asynchronous and anonymous systems. - Yves Mocquard; Bruno Sericola; Emmanuelle Anceaume (NCA, 2017)

Handling bitcoin conflicts through a glimpse of structure. - Thibaut Lajoie-Mazenc; Romaric Ludinard; Emmanuelle Anceaume (SAC, 2017)

Bitcoin a Distributed Shared Register. - Emmanuelle Anceaume; Romaric Ludinard; Maria Potop-Butucaru; Frédéric Tronel (SSS, 2017)

Lightweight Metric Computation for Distributed Massive Data Streams. - Emmanuelle Anceaume; Yann Busnel (Trans. Large Scale Data Knowl. Centered Syst., 2017)

Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model. - Emmanuelle Anceaume; Yann Busnel; Vasile Cazacu (DSN Workshops, 2018)

UTXOs as a Proof of Membership for Byzantine Agreement Based Cryptocurrencies. - Emmanuelle Anceaume; Antoine Guellier; Romaric Ludinard (iThings/GreenCom/CPSCom/SmartData, 2018)

On the Fly Detection of the Top-K Items in the Distributed Sliding Window Model. - Emmanuelle Anceaume; Yann Busnel; Vasile Cazacu (NCA, 2018)

Sycomore: A Permissionless Distributed Ledger that Self-Adapts to Transactions Demand. - Emmanuelle Anceaume; Antoine Guellier; Romaric Ludinard; Bruno Sericola (NCA, 2018)

Population Protocols with Convergence Detection. - Yves Mocquard; Bruno Sericola; Emmanuelle Anceaume (NCA, 2018)

Balanced Allocations and Global Clock in Population Protocols: An Accurate Analysis. - Yves Mocquard; Bruno Sericola; Emmanuelle Anceaume (SIROCCO, 2018)

Abstractions to Build Permissionless Systems. - Emmanuelle Anceaume (2019)

StakeCube: Combining Sharding and Proof-of-Stake to Build Fork-Free Secure Permissionless Distributed Ledgers. - Antoine Durand; Emmanuelle Anceaume; Romaric Ludinard (NETYS, 2019)

Blockchain abstract data type: poster. - Emmanuelle Anceaume; Antonella Del Pozzo; Romaric Ludinard; Maria Potop-Butucaru; Sara Tucci Piergiovanni (PPoPP, 2019)

Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols. - Yves Mocquard; Bruno Sericola; Emmanuelle Anceaume (SIROCCO, 2019)

Blockchain Abstract Data Type. - Emmanuelle Anceaume; Antonella Del Pozzo; Romaric Ludinard; Maria Potop-Butucaru; Sara Tucci Piergiovanni (SPAA, 2019)

The StakeCube blockchain : Instantiation, Evaluation & Applications. - Antoine Durand; Guillaume Hébert; Khalifa Toumi; Gérard Memmi; Emmanuelle Anceaume (BCCA, 2020)

Synchronous Byzantine Lattice Agreement in O(log(f) Rounds. - Giuseppe Antonio Di Luna; Emmanuelle Anceaume; Silvia Bonomi; Leonardo Querzoni (ICDCS, 2020)

Byzantine Generalized Lattice Agreement. - Giuseppe Antonio Di Luna; Emmanuelle Anceaume; Leonardo Querzoni (IPDPS, 2020)

Permissionless Consensus based on Proof-of-Eligibility. - Geoffrey Saunois; Frédérique Robin; Emmanuelle Anceaume; Bruno Sericola (NCA, 2020)

Probabilistic Analysis of Rumor-Spreading Time. - Yves Mocquard; Bruno Sericola; Emmanuelle Anceaume (INFORMS J. Comput., 2020)

Analysis of Rumor Spreading with 2-pull or 3-pull Operations. - Yves Mocquard; Bruno Sericola; Emmanuelle Anceaume (NCA, 2021)

Stochastic Analysis of Algorithms for Collecting Longitudinal Data. - Frédérique Robin; Bruno Sericola; Emmanuelle Anceaume (NCA, 2021)

On Finality in Blockchains. - Emmanuelle Anceaume; Antonella Del Pozzo; Thibault Rieutord; Sara Tucci Piergiovanni (OPODIS, 2021)

Stochastic analysis of average-based distributed algorithms. - Yves Mocquard; Frédérique Robin; Bruno Sericola; Emmanuelle Anceaume (J. Appl. Probab., 2021)

Byzantine-tolerant uniform node sampling service in large-scale networks. - Emmanuelle Anceaume; Yann Busnel; Bruno Sericola (Int. J. Parallel Emergent Distributed Syst., 2021)

Simulation study of Sycomore++, a self-adapting graph-based permissionless distributed ledger. - Aimen Djari; Emmanuelle Anceaume; Sara Tucci Piergiovanni (BRAINS, 2022)

An extensive agent-based simulation study of sycomore++, a DAG-based permissionless ledger. - Aimen Djari; Emmanuelle Anceaume; Sara Tucci Piergiovanni (SAC, 2022)

Stochastic Analysis of Rumor Spreading with Multiple Pull Operations in Presence of Non-cooperative Nodes. - Sébastien Kilian; Emmanuelle Anceaume; Bruno Sericola (EPEW, 2023)

Extending The Boundaries and Exploring The Limits Of Blockchain Compression. - Anurag Jain; Emmanuelle Anceaume; Sujit Gujar (SRDS, 2023)

Sharding in Permissionless Systems in Presence of an Adaptive Adversary. - Emmanuelle Anceaume; Davide Frey; Arthur Rauch (NETYS, 2024)

Asynchronous BFT Asset Transfer: Quasi-Anonymous, Light, and Consensus-Free. - Timothé Albouy; Emmanuelle Anceaume; Davide Frey; Mathieu Gestin; Arthur Rauch; Michel Raynal; François Taïani (CoRR, 2024)

Mining in Logarithmic Space with Variable Difficulty. - Loïc Miller; Dorian Pacaud; Nathanël Derousseaux-Lebert; Emmanuelle Anceaume; Romaric Ludinard (CCS, 2025)

Introduction to the Special Issue on "Blockchain Research and Applications for Innovative Networks and Services (BRAINS 2023)". - Yackolley Amoussou-Guenou; Emmanuelle Anceaume; Emmanuel Bertin; Antonella Del Pozzo; Axel Küpper (Distributed Ledger Technol. Res. Pract., 2025)