Soumyottam Chatterjee

CoRR, 2024

2022

A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables.

[BibT_eX]

[DOI]

John Augustine

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Byzantine-Resilient Counting in Networks.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

2020

The complexity of leader election in diameter-two networks.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity.

[BibT_eX]

[DOI]

Robert Gmyr

CoRR, 2020

Sleeping is Efficient: MIS in <i>O</i>(1)-rounds Node-averaged Awake Complexity.

[BibT_eX]

[DOI]

Robert Gmyr

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed MST: A Smoothed Analysis.

[BibT_eX]

[DOI]

Nguyen Dinh Pham

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Network Size Estimation in Small-World Networks Under Byzantine Faults.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018

Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs.

[BibT_eX]

[DOI]

Reza Fathi

Nguyen Dinh Pham

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

The Complexity of Leader Election: A Chasm at Diameter Two.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2010

Ferrers dimension and boxicity.

[BibT_eX]

[DOI]