| Publication | Date of Publication | Type |
|---|
Distributed computing in the asynchronous LOCAL model
Theoretical Computer Science | 2024-12-12 | Paper |
When is Recoverable Consensus Harder Than Consensus?
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Optimal algorithms for synchronous Byzantine \(k\)-set agreement
Theoretical Computer Science | 2023-09-07 | Paper |
Optimal algorithms for synchronous Byzantine \(k\)-set agreement
Lecture Notes in Computer Science | 2023-06-12 | Paper |
k-Immediate Snapshot and x-Set Agreement: How Are They Related?
| 2023-03-21 | Paper |
Communication Complexity of Wait-Free Computability in Dynamic Networks
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
Information and Computation | 2022-06-08 | Paper |
The assignment problem
Theoretical Computer Science | 2021-10-06 | Paper |
Making local algorithms wait-free: the case of ring coloring
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Making local algorithms wait-free: the case of ring coloring
Theory of Computing Systems | 2019-06-21 | Paper |
A characterization of \(t\)-resilient colorless task anonymous solvability
| 2019-01-30 | Paper |
scientific article; zbMATH DE number 6905187 (Why is no real title available?)
| 2018-07-18 | Paper |
Uniform consensus with homonyms and omission failures
Distributed Computing and Networking | 2016-12-19 | Paper |
\(t\)-resilient immediate snapshot Is impossible
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On the space complexity of set agreement?
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Wait-freedom with advice
Distributed Computing | 2015-03-25 | Paper |
Fast fault-tolerant agreement algorithms
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Wait-freedom with advice
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Linear space bootstrap communication schemes
Theoretical Computer Science | 2014-12-02 | Paper |
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Byzantine agreement with homonyms
Distributed Computing | 2014-03-28 | Paper |
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science | 2014-01-10 | Paper |
On implementing omega in systems with weak reliability and synchrony assumptions
Distributed Computing | 2013-06-28 | Paper |
Partial synchrony based on set timeliness
Distributed Computing | 2013-02-04 | Paper |
Stabilizing leader election in partial synchronous systems with crash failures
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
The disagreement power of an adversary
Distributed Computing | 2012-02-06 | Paper |
The minimum information about failures for solving non-local tasks in message-passing systems
Distributed Computing | 2012-02-06 | Paper |
Tight failure detection bounds on atomic object implementations
Journal of the ACM | 2010-07-14 | Paper |
Algorithms for Extracting Timeliness Graphs
Structural Information and Communication Complexity | 2010-06-17 | Paper |
The Disagreement Power of an Adversary
Lecture Notes in Computer Science | 2009-11-19 | Paper |
The Weakest Failure Detector for Message Passing Set-Agreement
Lecture Notes in Computer Science | 2008-11-20 | Paper |
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Secretive birds: privacy in population protocols
| 2008-04-22 | Paper |
The perfectly synchronized round-based model of distributed computing
Information and Computation | 2007-05-14 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Theoretical Aspects of Computing – ICTAC 2005
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mutual exclusion in asynchronous systems with failure detectors
Journal of Parallel and Distributed Computing | 2005-08-03 | Paper |
scientific article; zbMATH DE number 2013834 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 2006647 (Why is no real title available?)
| 2003-11-23 | Paper |
scientific article; zbMATH DE number 1696680 (Why is no real title available?)
| 2002-01-28 | Paper |
Parallélisation d'algorithmes avec un nombre fixe de processeurs
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
Sémantique asynchrone et comportements infinis en CPS
Theoretical Computer Science | 1987-01-01 | Paper |
