| Publication | Date of Publication | Type |
|---|
Which broadcast abstraction captures \(k\)-set agreement?
| 2023-02-03 | Paper |
Election in fully anonymous shared memory systems: tight space bounds and algorithms
| 2022-11-11 | Paper |
Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
Theoretical Computer Science | 2021-10-06 | Paper |
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Leader-based de-anonymization of an anonymous read/write memory
Theoretical Computer Science | 2020-08-25 | Paper |
Progress-space tradeoffs in single-writer memory implementations
| 2020-07-30 | Paper |
Anonymous Read/write memory: leader election and de-anonymization
| 2020-03-03 | Paper |
Untangling partial agreement: iterated \(x\)-consensus simulations
Lecture Notes in Computer Science | 2020-01-14 | Paper |
Are Byzantine failures really different from crash failures?
| 2018-08-16 | Paper |
Trading off \(t\)-resilience for efficiency in asynchronous Byzantine reliable broadcast
Parallel Processing Letters | 2017-12-15 | Paper |
The synchronization power of atomic bitwise operations
| 2017-09-29 | Paper |
A necessary condition for Byzantine \(k\)-set agreement
Information Processing Letters | 2016-08-16 | Paper |
Generalized symmetry breaking tasks and nondeterminism in concurrent objects
SIAM Journal on Computing | 2016-04-25 | Paper |
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
Structural Information and Communication Complexity | 2014-08-07 | Paper |
The weakest failure detector to implement a register in asynchronous systems with hybrid communication
Theoretical Computer Science | 2014-01-13 | Paper |
Towards a universal construction for transaction-based multiprocess programs
Theoretical Computer Science | 2014-01-10 | Paper |
Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
Theoretical Computer Science | 2012-08-10 | Paper |
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Help when needed, but no more: efficient read/write partial snapshot
Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
A note on atomicity: boosting Test\&Set to solve consensus
Information Processing Letters | 2010-08-16 | Paper |
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Help When Needed, But No More: Efficient Read/Write Partial Snapshot
Lecture Notes in Computer Science | 2009-11-19 | Paper |
