An optimal generalization of Alon and Füredi's covering result. - Arijit Ghosh; Chandrima Kayal; Soumi Nandi (CoRR, 2022)

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 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2023)

Separations between Combinatorial Measures for Transitive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2023)

Covering almost all the layers of the hypercube with multiplicities. - Arijit Ghosh; Chandrima Kayal; Soumi Nandi (Discret. Math., 2023)

Approximate Degree Composition for Recursive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Nitin Saurabh (APPROX/RANDOM, 2024)

About almost covering subsets of the hypercube. - Arijit Ghosh; Chandrima Kayal; Soumi Nandi (CoRR, 2024)

Relations between monotone complexity measures based on decision tree complexity. - Farzan Byramji; Vatsal Jha; Chandrima Kayal; Rajat Mittal 001 (Electron. Colloquium Comput. Complex., 2024)

Testing Isomorphism of Boolean Functions over Finite Abelian Groups. - Swarnalipa Datta; Arijit Ghosh; Chandrima Kayal; Manaswi Paraashar; Manmatha Roy (CoRR, 2025)