| On the composition of randomized query complexity and approximate degree S Chakraborty, C Kayal, R Mittal, M Paraashar, S Sanyal, N Saurabh arXiv preprint arXiv:2307.03900, 2023 | 5 | 2023 |
| Separations between combinatorial measures for transitive functions S Chakraborty, C Kayal, M Paraashar arXiv preprint arXiv:2103.12355, 2021 | 4 | 2021 |
| Covering almost all the layers of the hypercube with multiplicities A Ghosh, C Kayal, S Nandi Discrete Mathematics 346 (7), 113397, 2023 | 3 | 2023 |
| Approximate degree composition for recursive functions S Chakraborty, C Kayal, R Mittal, M Paraashar, N Saurabh arXiv preprint arXiv:2407.08385, 2024 | 1 | 2024 |
| About almost covering subsets of the hypercube A Ghosh, C Kayal, S Nandi arXiv preprint arXiv:2409.10573, 2024 | | 2024 |
| Relations between monotone complexity measures based on decision tree complexity F Byramji, V Jha, C Kayal, R Mittal arXiv preprint arXiv:2406.07859, 2024 | | 2024 |
| Effects of symmetry in combinatorial complexity measures of Boolean functions C Kayal Indian Statistical Institute, Kolkata, 2024 | | 2024 |
| Linear isomorphism testing of Boolean functions with small approximate spectral norm A Ghosh, C Kayal, M Paraashar, M Roy arXiv preprint arXiv:2308.02662, 2023 | | 2023 |
| On higher multiplicity hyperplane and polynomial covers for symmetry preserving subsets of the hypercube A Ghosh, C Kayal, S Nandi, S Venkitesh arXiv preprint arXiv:2307.16881, 2023 | | 2023 |
Manaswi ParaasharUniversity of CopenhagenVerifisert e-postadresse på ku.dk
