default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSwagato Sanyal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Nikhil S. Mande
, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. ACM Trans. Comput. Theory 16(2): 9:1-9:26 (2024)- [c20]Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Communication Complexity of Finding a King in a Tournament. APPROX/RANDOM 2024: 64:1-64:23 - [c19]Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal:
On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. MFCS 2024: 40:1-40:16 - [c18]Swagato Sanyal:
Randomized Query Composition and Product Distributions. STACS 2024: 56:1-56:19 - [i34]Swagato Sanyal:
Randomized query composition and product distributions. CoRR abs/2401.15352 (2024) - [i33]Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the communication complexity of finding a king in a tournament. CoRR abs/2402.14751 (2024) - [i32]Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal:
On Fourier analysis of sparse Boolean functions over certain Abelian groups. CoRR abs/2406.18700 (2024) - [i31]Koustav De, Palash Dey, Swagato Sanyal:
Voter Participation Control in Online Polls. CoRR abs/2410.12256 (2024) - [i30]Swagato Sanyal:
Randomized query composition and product distributions. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j6]Dmytro Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
Optimal Composition Theorem for Randomized Query Complexity. Theory Comput. 19: 1-35 (2023) - [c17]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. APPROX/RANDOM 2023: 63:1-63:23 - [c16]Debajyoti Kar, Palash Dey, Swagato Sanyal:
Sampling-Based Winner Prediction in District-Based Elections. AAMAS 2023: 2661-2663 - [c15]Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya, Arlei Silva, Palash Dey, Swagato Sanyal:
Feature-based Individual Fairness in k-clustering. AAMAS 2023: 2772-2774 - [c14]Rahul Chugh, Supartha Podder, Swagato Sanyal:
Decision Tree Complexity Versus Block Sensitivity and Degree. FSTTCS 2023: 27:1-27:23 - [c13]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees via Stifling. ITCS 2023: 33:1-33:20 - [c12]Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. STOC 2023: 867-880 - [i29]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. CoRR abs/2307.03900 (2023) - [i28]Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh:
On the Composition of Randomized Query Complexity and Approximate Degree. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c11]Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
One-Way Communication Complexity and Non-Adaptive Decision Trees. STACS 2022: 49:1-49:24 - [i27]Palash Dey, Debajyoti Kar, Swagato Sanyal:
Sampling-Based Winner Prediction in District-Based Elections. CoRR abs/2203.00083 (2022) - [i26]Rahul Chugh, Supartha Podder, Swagato Sanyal:
Decision Tree Complexity versus Block Sensitivity and Degree. CoRR abs/2209.08042 (2022) - [i25]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. CoRR abs/2211.17214 (2022) - [i24]Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. Electron. Colloquium Comput. Complex. TR22 (2022) - [i23]Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif:
Lifting to Parity Decision Trees Via Stifling. Electron. Colloquium Comput. Complex. TR22 (2022) - [i22]Rahul Chugh, Supartha Podder, Swagato Sanyal:
Decision Tree Complexity versus Block Sensitivity and Degree. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c10]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-Lemma-Type Bounds for Boolean Functions. FSTTCS 2021: 10:1-10:22 - [i21]Nikhil S. Mande, Swagato Sanyal:
One-way communication complexity and non-adaptive decision trees. CoRR abs/2105.01963 (2021) - [i20]Debajyoti Kar, Sourav Medya, Debmalya Mandal, Arlei Silva, Palash Dey, Swagato Sanyal:
Feature-based Individual Fairness in k-Clustering. CoRR abs/2109.04554 (2021) - [i19]Nikhil S. Mande, Swagato Sanyal:
One-way communication complexity and non-adaptive decision trees. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j5]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020) - [c9]Nikhil S. Mande, Swagato Sanyal:
On Parity Decision Trees for Fourier-Sparse Boolean Functions. FSTTCS 2020: 29:1-29:16 - [i18]Nikhil S. Mande, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. CoRR abs/2008.00266 (2020) - [i17]Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-lemma-type bounds for Boolean functions. CoRR abs/2012.02335 (2020) - [i16]Nikhil S. Mande, Swagato Sanyal:
On parity decision trees for Fourier-sparse Boolean functions. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j4]Swagato Sanyal:
Fourier Sparsity and Dimension. Theory Comput. 15: 1-13 (2019) - [c8]Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. ICALP 2019: 64:1-64:13 - 2018
- [j3]Sagnik Mukhopadhyay, Jaikumar Radhakrishnan, Swagato Sanyal:
Separation Between Deterministic and Randomized Query Complexity. SIAM J. Comput. 47(4): 1644-1666 (2018) - [c7]Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev:
Linear Sketching over F_2. CCC 2018: 8:1-8:37 - [c6]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219 - [i15]Swagato Sanyal:
A Composition Theorem via Conflict Complexity. CoRR abs/1801.03285 (2018) - [i14]Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A composition theorem for randomized query complexity via max conflict complexity. CoRR abs/1811.10752 (2018) - [i13]Swagato Sanyal:
A Composition Theorem via Conflict Complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c5]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - [i12]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017) - [i11]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017) - [i10]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i9]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i8]Swagato Sanyal:
One-way Communication and Non-adaptive Decision Tree. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Jaikumar Radhakrishnan, Swagato Sanyal:
The Zero-Error Randomized Query Complexity of the Pointer Function. FSTTCS 2016: 16:1-16:13 - [i7]Jaikumar Radhakrishnan, Swagato Sanyal:
The zero-error randomized query complexity of the pointer function. CoRR abs/1607.01684 (2016) - [i6]Jaikumar Radhakrishnan, Swagato Sanyal:
The zero-error randomized query complexity of the pointer function. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c3]Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. FSTTCS 2015: 206-220 - [c2]Swagato Sanyal:
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity. ICALP (1) 2015: 1035-1045 - [i5]Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. CoRR abs/1506.06399 (2015) - [i4]Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i3]Swagato Sanyal:
Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity. CoRR abs/1407.3500 (2014) - [i2]Swagato Sanyal:
Sub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2011
- [j2]Monish Chatterjee, Swagato Sanyal, Mita Nasipuri, Uma Bhattacharya:
A wavelength assignment algorithm for de Bruijn WDM networks. Int. J. Parallel Emergent Distributed Syst. 26(6): 477-491 (2011) - 2010
- [j1]Sayan Bhattacharya, Goutam Paul, Swagato Sanyal:
A cops and robber game in multidimensional grids. Discret. Appl. Math. 158(16): 1745-1751 (2010) - [c1]Swagato Sanyal, Raja S, Somenath Biswas:
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. GECCO 2010: 1417-1424
2000 – 2009
- 2009
- [i1]Sayan Bhattacharya, Goutam Paul, Swagato Sanyal:
On Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids. CoRR abs/0909.1381 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
