Chandrima Kayal

According to our database, Chandrima Kayal authored at least 12 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Hardness Condensation for Decision Tree Measures by Restrictions.

Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh

CoRR, February, 2026

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing.

Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

CoRR, January, 2026

About almost covering subsets of the hypercube.

Arijit Ghosh, Chandrima Kayal, Soumi Nandi

Discret. Math., 2026

Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions.

Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Testing Isomorphism of Boolean Functions over Finite Abelian Groups.

Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

Proceedings of the Approximation, 2025

2024

Relations Between Monotone Complexity Measures Based on Decision Tree Complexity.

Farzan Byramji, Vatsal Jha, Chandrima Kayal, Rajat Mittal

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

Approximate Degree Composition for Recursive Functions.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh

Proceedings of the Approximation, 2024

2023

Covering almost all the layers of the hypercube with multiplicities.

Arijit Ghosh, Chandrima Kayal, Soumi Nandi

Discret. Math., July, 2023

Linear isomorphism testing of Boolean functions with small approximate spectral norm.

Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy

CoRR, 2023

On the Composition of Randomized Query Complexity and Approximate Degree.

Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh

Proceedings of the Approximation, 2023

2022

An optimal generalization of Alon and Füredi's covering result.

Arijit Ghosh, Chandrima Kayal, Soumi Nandi

CoRR, 2022

Separations Between Combinatorial Measures for Transitive Functions.

Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022