Anil Ada

According to our database, Anil Ada authored at least 7 papers between 2007 and 2017.

Collaborative distances:

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

2017

On the Spectral Properties of Symmetric Functions.

Anil Ada, Omar Fawzi, Raghav Kulkarni

CoRR, 2017

2015

The NOF Multiparty Communication Complexity of Composed Functions.

Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen

Comput. Complex., 2015

2014

The Hardness of Being Private.

Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi

ACM Trans. Comput. Theory, 2014

2012

Spectral Norm of Symmetric Functions.

Anil Ada, Omar Fawzi, Hamed Hatami

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2010

On the Non-Deterministic Communication Complexity of Regular Languages.

Anil Ada

Int. J. Found. Comput. Sci., 2010

2008

Multiparty Communication Complexity of Disjointness.

Arkadev Chattopadhyay, Anil Ada

Electron. Colloquium Comput. Complex., 2008

2007

On Bus Graph Realizability.

Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007