Patterned non-determinism in communication complexity. - Dmytro Gavinsky (Electron. Colloquium Comput. Complex., 2023)

Optimal Composition Theorem for Randomized Query Complexity. - Dmytro Gavinsky; Troy Lee; Miklos Santha; Swagato Sanyal (Theory Comput., 2023)

Unambiguous parity-query complexity. - Dmytro Gavinsky (Electron. Colloquium Comput. Complex., 2024)