Manuel Vidigueira

Orcid: 0009-0008-5821-2571

According to our database1, Manuel Vidigueira authored at least 15 papers between 2022 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Byzantine consensus is Θ (n<sup>2)</sup>: the Dolev-Reischuk bound is tight even in partial synchrony!
Distributed Comput., June, 2024

DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication.
IACR Cryptol. ePrint Arch., 2024

Error-Free Near-Optimal Validated Agreement.
CoRR, 2024

Partial synchrony for free? New bounds for Byzantine agreement via a generic transformation across network models.
CoRR, 2024

Efficient Signature-Free Validated Agreement.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

All Byzantine Agreement Problems Are Expensive.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Chop Chop: Byzantine Atomic Broadcast to the Network Limit.
Proceedings of the 18th USENIX Symposium on Operating Systems Design and Implementation, 2024

2023
Strong Byzantine Agreement with Adaptive Word Complexity.
CoRR, 2023

Every Bit Counts in Consensus.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

On the Validity of Consensus.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Oracular Byzantine Reliable Broadcast [Extended Version].
CoRR, 2022

Carbon: An Asynchronous Voting-Based Payment System for a Client-Server Architecture.
CoRR, 2022

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version].
CoRR, 2022

Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Oracular Byzantine Reliable Broadcast.
Proceedings of the 36th International Symposium on Distributed Computing, 2022


  Loading...