Construction of relative difference sets and Hadamard groups. - Bernhard Schmidt 001; Ming Ming Tan (Des. Codes Cryptogr., 2014)

Minimizing Cost in IaaS Clouds Via Scheduled Instance Reservation. - Qiushi Wang; Ming Ming Tan; Xueyan Tang; Wentong Cai 001 (ICDCS, 2017)

Group invariant weighing matrices. - Ming Ming Tan (Des. Codes Cryptogr., 2018)

Cloud Scheduling with Discrete Charging Units. - Ming Ming Tan; Runtian Ren; Xueyan Tang (IEEE Trans. Parallel Distributed Syst., 2019)

Improved Tradeoffs for Leader Election. - Shay Kutten; Peter Robinson 002; Ming Ming Tan; Xianbin Zhu 002 (PODC, 2023)

Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks. - Peter Robinson 002; Ming Ming Tan (CoRR, 2024)

Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up. - Peter Robinson 002; Ming Ming Tan (PODC, 2025)

Brief Announcement: Perfect Matching with Few Link Activations. - Hugo Mirault; Peter Robinson 002; Ming Ming Tan; Xianbin Zhu 002 (SIROCCO, 2025)

Perfect Matching with Few Link Activations. - Hugo Mirault; Peter Robinson 002; Ming Ming Tan; Xianbin Zhu 002 (CoRR, 2025)

Tight bounds on the message complexity of distributed tree verification. - Shay Kutten; Peter Robinson 002; Ming Ming Tan (Distributed Comput., 2025)

Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model. - Peter Robinson 002; Ming Ming Tan (CoRR, 2025)