SS
Swagato Sanyal
cs.CCcs.DScs.AIcs.DMquant-phcs.CYcs.GTcs.LGcs.MAmath.CO
On Valency
published · living versionsW_hggp7tm4·v1 · currentpublished
A Simple Subquadratic Cut Query Protocol for Directed Reachability
with Henry Fleischmann, Sagnik Mukhopadhyay
1 version
Preprints & journals
22 papers in the corpus · 2009–2026Query-efficient winner prediction in district-based elections2610.00577v1 · Koustav De, Debajyoti Kar, Swagato Sanyal2026 · 0 citationsarXiv
Quantum Search With Generalized Wildcards2511.04669v2 · Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro et al.2025 · 0 citationsarXiv
Complexity of learning matchings and half graphs via edge queries2507.03151v2 · Nikhil S. Mande, Swagato Sanyal, Viktor Zamaraev2025 · 0 citationsarXiv
Voter Participation Control in Online Polls2410.12256v2 · Koustav De, Palash Dey, Swagato Sanyal2024 · 0 citationsarXiv
On the communication complexity of finding a king in a tournament2402.14751v1 · Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal et al.2024 · 0 citationsarXiv
Randomized query composition and product distributions2401.15352v1 · Swagato Sanyal2024 · 0 citationsarXiv
On the Composition of Randomized Query Complexity and Approximate Degree2307.03900v2 · Sourav Chakraborty, Chandrima Kayal, Rajat Mittal et al.2023 · 0 citationsarXiv
Lifting to Parity Decision Trees Via Stifling2211.17214v1 · Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal et al.2022 · 4 citationsarXiv
Decision Tree Complexity versus Block Sensitivity and Degree2209.08042v1 · Rahul Chugh, Supartha Podder, Swagato Sanyal2022 · 0 citationsarXiv
Sampling-Based Winner Prediction in District-Based Elections2203.00083v1 · Palash Dey, Debajyoti Kar, Swagato Sanyal2022 · 1 citationarXiv
Feature-based Individual Fairness in k-Clustering2109.04554v2 · Debajyoti Kar, Mert Kosan, Debmalya Mandal et al.2021 · 5 citationsarXiv
One-way communication complexity and non-adaptive decision trees2105.01963v3 · Nikhil S. Mande, Swagato Sanyal, Suhail Sherif2021 · 0 citationsarXiv
Tight Chang's-lemma-type bounds for Boolean functions2012.02335v2 · Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal et al.2020 · 2 citationsarXiv
On parity decision trees for Fourier-sparse Boolean functions2008.00266v1 · Nikhil S. Mande, Swagato Sanyal2020 · 3 citationsarXiv
A composition theorem for randomized query complexity via max conflict complexity1811.10752v1 · Dmitry Gavinsky, Troy Lee, Miklos Santha et al.2018 · 4 citationsarXiv
A Composition Theorem via Conflict Complexity1801.03285v1 · Swagato Sanyal2018 · 4 citationsarXiv
Quadratically Tight Relations for Randomized Query Complexity1708.00822v1 · Dmitry Gavinsky, Rahul Jain, Hartmut Klauck et al.2017 · 1 citationarXiv
A Composition Theorem for Randomized Query Complexity1706.00335v2 · Anurag Anshu, Dmitry Gavinsky, Rahul Jain et al.2017 · 2 citationsarXiv
The zero-error randomized query complexity of the pointer function1607.01684v1 · Jaikumar Radhakrishnan, Swagato Sanyal2016 · 1 citationarXiv
Towards Better Separation between Deterministic and Randomized Query Complexity1506.06399v2 · Sagnik Mukhopadhyay, Swagato Sanyal2015 · 4 citationsarXiv
Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity1407.3500v1 · Swagato Sanyal2014 · 1 citationarXiv
On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids0909.1381v1 · Sayan Bhattacharya, Goutam Paul, Swagato Sanyal2009 · 16 citationsDiscrete Applied Mathematics, pages 1745--1751, vol. 158, no. 16, August 2010
Career total: 40 works. 22 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.