On quantum versus classical query complexity. - Scott Aaronson; Andris Ambainis; Andrej Bogdanov; Krishnamoorthy Dinesh 001; Tsun Ming Cheung (Electron. Colloquium Comput. Complex., 2021)

Separation of the factorization norm and randomized communication complexity. - TsunMing Cheung; Hamed Hatami; Kaave Hosseini; Morgan Shirley (Electron. Colloquium Comput. Complex., 2022)

Boolean functions with small approximate spectral norm. - TsunMing Cheung; Hamed Hatami; Rosie Zhao; Itai Zilberstein (Electron. Colloquium Comput. Complex., 2022)

Online Learning and Disambiguations of Partial Concept Classes. - TsunMing Cheung; Hamed Hatami; Pooya Hatami; Kaave Hosseini (ICALP, 2023)

A tight lower bound on non-adaptive group testing estimation. - Tsun-Ming Cheung; Hamed Hatami; Anthony Ostuni (CoRR, 2023)

Communication complexity of half-plane membership. - Manasseh Ahmed; TsunMing Cheung; Hamed Hatami; Kusha Sareen (Electron. Colloquium Comput. Complex., 2023)

Classical simulation of one-query quantum distinguishers. - Andrej Bogdanov; TsunMing Cheung; Krishnamoorthy Dinesh 001; John C. S. Lui (Electron. Colloquium Comput. Complex., 2023)

Communication Complexity and Discrepancy of Halfplanes. - Manasseh Ahmed; Tsun-Ming Cheung; Hamed Hatami; Kusha Sareen (SoCG, 2024)

A Lower Bound on the Trace Norm of Boolean Matrices and its Applications. - Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Aleksandar Nikolov; Toniann Pitassi; Morgan Shirley (Electron. Colloquium Comput. Complex., 2024)

A tight lower bound on non-adaptive group testing estimation. - Nader H. Bshouty; Tsun-Ming Cheung; Gergely Harcos; Hamed Hatami; Anthony Ostuni (Discret. Appl. Math., 2025)