Bounds on Oblivious Multiparty Quantum Communication Complexity. - François Le Gall; Daiki Suruga (LATIN, 2022)

A probabilistic analysis on general probabilistic scheduling problems. - Daiki Suruga (ISIT, 2024)

Direct sum theorems beyond query complexity. - Daiki Suruga (CoRR, 2024)

Matching upper bounds on symmetric predicates in quantum communication complexity. - Daiki Suruga (Quantum Inf. Comput., 2024)

A Unified Approach and Solutions for $n$-Task Problems. - Daiki Suruga (ISIT, 2025)

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group. - Daiki Suruga (CoRR, 2025)