Ming Ming Tan

Orcid: 0000-0002-5279-5314

According to our database1, Ming Ming Tan authored at least 11 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Deterministic Lower Bounds for <i>k</i>-Edge Connectivity in the Distributed Sketching Model.
CoRR, July, 2025

Tight bounds on the message complexity of distributed tree verification.
Distributed Comput., June, 2025

Perfect Matching with Few Link Activations.
CoRR, June, 2025

Brief Announcement: Perfect Matching with Few Link Activations.
Proceedings of the Structural Information and Communication Complexity, 2025

Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

2024
Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks.
CoRR, 2024

2023
Improved Tradeoffs for Leader Election.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2019
Cloud Scheduling with Discrete Charging Units.
IEEE Trans. Parallel Distributed Syst., 2019

2018
Group invariant weighing matrices.
Des. Codes Cryptogr., 2018

2017
Minimizing Cost in IaaS Clouds Via Scheduled Instance Reservation.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2014
Construction of relative difference sets and Hadamard groups.
Des. Codes Cryptogr., 2014


  Loading...