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)

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 (16th Innovations in Theoretical Computer Science Conference, ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA, 2025)

Communication Complexity and Discrepancy of Halfplanes - Manasseh Ahmed; Tsun-Ming Cheung; Hamed Hatami; Kusha Sareen (40th International Symposium on Computational Geometry, SoCG 2024, June 11-14, 2024, Athens, Greece, 2024)

Boolean Functions with Small Approximate Spectral Norm - Tsun-Ming Cheung; Hamed Hatami; Rosie Zhao; Itai Zilberstein (CoRR, 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)

Classical Simulation of One-Query Quantum Distinguishers - Andrej Bogdanov; Tsun Ming Cheung; Krishnamoorthy Dinesh; John C. S. Lui (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, 2023)

Separation of the Factorization Norm and Randomized Communication Complexity - Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Morgan Shirley (38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, 2023)

Online Learning and Disambiguations of Partial Concept Classes - TsunMing Cheung; Hamed Hatami; Pooya Hatami; Kaave Hosseini (50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, 2023)

Online Learning and Disambiguations of Partial Concept Classes - TsunMing Cheung; Hamed Hatami; Pooya Hatami; Kaave Hosseini (CoRR, 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; John C. S. Lui (Electron. Colloquium Comput. Complex., 2023)

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)

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