E-LIB Suche - Ergebnisse für: Sanyal, Swagato

1

On parity decision trees for Fourier-sparse Boolean functio..:

Mande, Nikhil Shekhar ; Sanyal, Swagato
ACM Transactions on Computation Theory. 16 (2024) 2 - p. 1-26 , 2024

Link: https://doi.org/10.1145/..

2

Randomized versus Deterministic Decision Tree Size:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Chattopadhyay, Arkadev ; Dahiya, Yogesh ; Mande, Nikhil S... - p. 867-880 , 2023

Link: https://dl.acm.org/doi/1..

3

Quadratically Tight Relations for Randomized Query Complexi..:

Jain, Rahul ; Klauck, Hartmut ; Kundu, Srijita...
Theory of Computing Systems. 64 (2019) 1 - p. 101-119 , 2019

Link: https://doi.org/10.1007/..

4

Separation Between Deterministic and Randomized Query Compl..:

Mukhopadhyay, Sagnik ; Radhakrishnan, Jaikumar ; Sanyal, Swagato
SIAM Journal on Computing. 47 (2018) 4 - p. 1644-1666 , 2018

Link: https://doi.org/10.1137/..

5

Linear sketching over F2:

, In: Proceedings of the 33rd Computational Complexity Conference,

Kannan, Sampath ; Mossel, Elchanan ; Sanyal, Swagato. - p. 1-37 , 2018

Link: https://dl.acm.org/doi/1..

6

A wavelength assignment algorithm for de Bruijn WDM network:

Chatterjee, Monish ; Sanyal, Swagato ; Nasipuri, Mita.
International Journal of Parallel, Emergent and Distributed Systems. 26 (2011) 6 - p. 477-491 , 2011

Link: https://doi.org/10.1080/..

7

A cops and robber game in multidimensional grids:

Bhattacharya, Sayan ; Paul, Goutam ; Sanyal, Swagato
Discrete Applied Mathematics. 158 (2010) 16 - p. 1745-1751 , 2010

Link: https://doi.org/10.1016/..

8

Necessary and sufficient conditions for success of the metr..:

, In: Proceedings of the 12th annual conference on Genetic and evolutionary computation,

Sanyal, Swagato ; S, Raja ; Biswas, Somenath - p. 1417-1424 , 2010

Link: https://dl.acm.org/doi/1..

9

Channel Assignment in a High-Bandwidth de Bruijn Optical WD..:

, In: 2008 16th International Conference on Advanced Computing and Communications,

Chatterjee, Monish ; Sanyal, Swagato ; Bhattacharya, Uma - p. None , 2008

Link: https://doi.org/10.1109/..

10

Randomized query composition and product distributions:

Sanyal, Swagato
http://arxiv.org/abs/2401.15352. , 2024

Link: http://arxiv.org/abs/240..

11

Lifting to Parity Decision Trees via Stifling:

Chattopadhyay, Arkadev ; Mande, Nikhil S ; Sanyal, Swagato.
doi:10.4230/LIPIcs.ITCS.2023.33. , 2023

Link: https://doi.org/10.4230/..

12

On the Composition of Randomized Query Complexity and Appro..:

Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat...
Chakraborty , S , Kayal , C , Mittal , R , Paraashar , M , Sanyal , S & Saurabh , N 2023 , On the Composition of Randomized Query Complexity and Approximate Degree . in N Megow & A Smith (eds) , Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques, APPROX/RANDOM 2023 . , 63 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , Dagstuhl , Leibniz International Proceedings in Informatics, LIPIcs , vol. 275 , 26th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2023 and the 27th International Conference on Randomization and Computation, RANDOM 2023 , Atlanta , United States , 11/09/2023 . https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63. , 2023

Link: https://pure.au.dk/porta..

13

On the Composition of Randomized Query Complexity and Appro..:

Chakraborty, Sourav ; Kayal, Chandrima ; Mittal, Rajat...
http://arxiv.org/abs/2307.03900. , 2023

Link: http://arxiv.org/abs/230..

14

Decision Tree Complexity Versus Block Sensitivity and Degre:

Chugh, Rahul ; Podder, Supartha ; Sanyal, Swagato
Is Part Of LIPIcs, Volume 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). , 2023

Link: https://doi.org/10.4230/..

15

Sampling-Based Winner Prediction in District-Based Election:

Dey, Palash ; Kar, Debajyoti ; Sanyal, Swagato
http://arxiv.org/abs/2203.00083. , 2022

Link: http://arxiv.org/abs/220..