Muhammad Ayaz Dzulfikar

Orcid: 0009-0002-7962-0677

According to our database1, Muhammad Ayaz Dzulfikar authored at least 12 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Byzantine Agreement with Predictions.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

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

DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

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

Egalitarian Price of Fairness for Indivisible Goods.
Proceedings of the PRICAI 2023: Trends in Artificial Intelligence, 2022

2019
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper).
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019


  Loading...