Swagato Sanyal

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On parity decision trees for Fourier-sparse Boolean functions	2026-03-23	Paper
Randomized query composition and sabotage complexity ACM Transactions on Computation Theory	2026-01-20	Paper
Randomized query composition and product distributions	2025-11-10	Paper
On the communication complexity of finding a king in a tournament	2025-10-06	Paper
Decision tree complexity versus block sensitivity and degree	2025-07-28	Paper
On parity decision trees for Fourier-sparse Boolean functions ACM Transactions on Computation Theory	2025-02-25	Paper
On the composition of randomized query complexity and approximate degree	2025-01-14	Paper
Lifting to parity decision trees via stifling	2024-09-25	Paper
Randomized versus deterministic decision tree size	2024-05-08	Paper
One-way communication complexity and non-adaptive decision trees	2024-04-23	Paper
scientific article; zbMATH DE number 7799588 (Why is no real title available?) (available as arXiv preprint)	2024-02-05	Paper
scientific article; zbMATH DE number 7789149 (Why is no real title available?) Theory of Computing	2024-01-16	Paper
scientific article; zbMATH DE number 7561557 (Why is no real title available?) (available as arXiv preprint)	2022-07-21	Paper
A composition theorem for randomized query complexity (available as arXiv preprint)	2020-11-25	Paper
scientific article; zbMATH DE number 7250148 (Why is no real title available?)	2020-09-22	Paper
Quadratically tight relations for randomized query complexity Theory of Computing Systems	2020-02-27	Paper
Fourier sparsity and dimension Theory of Computing	2019-12-05	Paper
Quadratically tight relations for randomized query complexity Lecture Notes in Computer Science	2018-11-28	Paper
Separation between deterministic and randomized query complexity SIAM Journal on Computing	2018-09-18	Paper
The Zero-Error Randomized Query Complexity of the Pointer Function (available as arXiv preprint)	2018-04-19	Paper
Towards better separation between deterministic and randomized query complexity (available as arXiv preprint)	2017-07-13	Paper
Near-optimal upper bound on Fourier dimension of Boolean functions in terms of Fourier sparsity Automata, Languages, and Programming	2015-10-27	Paper
A cops and robber game in multidimensional grids Discrete Applied Mathematics	2010-11-05	Paper

Research outcomes over time

This page was built for person: Swagato Sanyal