Paper accepted at PoPETS 2025

Congratulations to Dimitri Lereverend, Davide Frey, and François Taiani for their work “Low-Cost Privacy-Preserving Decentralized Learning” accepted at PoPETS 2025. The paper explores the use of correlated noise in decentralized learning to achieve an efficient privacy-utility tradeoff. Decentralized learning allows machine learning while keeping individual data local and private, but…

Continue reading

Paper accepted at AAAI 2025

Congratulations to Augustin Godinot, Erwan Le Merrer, and Francois Taiani for their paper entitled “Queries, Representation & Detection: the next 100 model fingerprinting schemes” accepted at AAAI 2025, a flagship conference in artificial intelligence. Comparing learned models is a fundamental task in Machine Learning (ML). In this paper, they studied model…

Continue reading

Paper accepted at NSDI 2025

Congratulations to Brice Ekane, Djob Mvondo, and Yérom-David Bromberg for their paper entitled “DiSC: Backpressure Mitigation In Multi-tier Applications With Distributed Shared Connection” accepted at NSDI 2025, a flagship conference in network and systems. This work targets load reduction on frontend servers by intelligently displacing the load on backend servers…

Continue reading

Paper accepted at FOCS 2024!

George Giakkoupis and Dimitrios Los from the WIDE team, jointly with Marcos Kiwi (Universidad de Chile), had their paper entitled “Naively Sorting Evolving Data is Optimal and Robust” accepted at FOCS 2024, one of the leading conferences in computer science! In this paper, the authors study sorting in the evolving…

Continue reading

Paper accepted at PODC 2024!

Congratulations to George Giakkoupis for his paper entitled “Faster Randomized Repeated Choice and DCAS” with Dante Bencivenga and Philipp Woelfel, accepted at PODC 2024. In this paper, the authors revisit the Double-Compare-and-Swap (DCAS) problem. DCAS is a useful and fundamental synchronization primitive for shared memory systems, which, contrary to CAS,…

Continue reading

Paper accepted at ICDCS 2024

Congratulations to Manon Sourisseau, Jérémie Decouchant, François Taïani, and David Bromberg for their paper entitled “Partition Detection in Byzantine Networks” accepted at ICDCS 2024. Jérémie works at TU Delft; meanwhile, all remaining authors are members of the WIDE team. The paper addresses the problem of detecting network partitions while considering the…

Continue reading

Paper accepted at Distributed Computing!

An extended version of the paper “Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case”, published at DISC 2022, has been accepted at Distributed Computing, a leading journal in the field of distributed algorithms. The paper, authored by Timothé Albouy, Davide Frey, Michel Raynal and François Taïani, presents…

Continue reading