| Publication | Date of Publication | Type |
|---|
| Brief announcement: Know your audience. Communication model and computability in anonymous networks | 2025-06-13 | Paper |
| Simulating reliable links with unreliable links in the presence of process crashes | 2024-07-11 | Paper |
| Synchronization Modulo k in Dynamic Networks | 2023-04-21 | Paper |
Synchronization modulo \(P\) in dynamic networks
Theoretical Computer Science | 2022-12-21 | Paper |
Measure of parallelism of distributed computations
STACS 89 | 2022-08-16 | Paper |
Geometric bounds for convergence rates of averaging algorithms
Information and Computation | 2022-06-08 | Paper |
MinMax algorithms for stabilizing consensus
Distributed Computing | 2021-09-06 | Paper |
Synchronous, asynchronous, and causally ordered communication
Distributed Computing | 2020-11-30 | Paper |
| The firing squad problem revisited | 2020-08-05 | Paper |
The firing squad problem revisited
Theoretical Computer Science | 2019-10-07 | Paper |
Time complexity of link reversal routing
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Fast, robust, quantizable approximate consensus | 2017-12-19 | Paper |
In search of lost time
Information Processing Letters | 2017-11-03 | Paper |
New transience bounds for max-plus linear systems
Discrete Applied Mathematics | 2017-01-23 | Paper |
Approximate consensus in highly dynamic networks: the role of averaging algorithms
Automata, Languages, and Programming | 2015-11-04 | Paper |
An overview of transience bounds in max-plus algebra
Contemporary Mathematics | 2015-09-11 | Paper |
On the impossibility of group membership
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Tolerating corrupted communication
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Transience bounds for distributed algorithms
Lecture Notes in Computer Science | 2013-08-16 | Paper |
Link reversal routing with binary link labels: work complexity
SIAM Journal on Computing | 2013-07-24 | Paper |
The Heard-Of model: computing in distributed systems with benign faults
Distributed Computing | 2013-06-28 | Paper |
A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
Lecture Notes in Computer Science | 2009-11-19 | Paper |
SOFSEM 2004: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Uniform consensus is harder than consensus
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080904 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1950669 (Why is no real title available?) | 2003-07-17 | Paper |
| scientific article; zbMATH DE number 1759635 (Why is no real title available?) | 2002-06-25 | Paper |
Calculs approchés de la borne inférieure de valeurs réparties
RAIRO - Theoretical Informatics and Applications | 1998-07-27 | Paper |
Introduction à l'algorithmique des objets partagés
RAIRO - Theoretical Informatics and Applications | 1997-12-14 | Paper |
Coupling coefficients of a distributed execution
Theoretical Computer Science | 1993-05-16 | Paper |
Concerning the size of logical clocks in distributed systems
Information Processing Letters | 1992-06-27 | Paper |
