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 (CCCG, 2007)

Multiparty Communication Complexity of Disjointness. - Arkadev Chattopadhyay; Anil Ada (Electron. Colloquium Comput. Complex., 2008)

On the Non-Deterministic Communication Complexity of Regular Languages. - Anil Ada (Int. J. Found. Comput. Sci., 2010)

Spectral Norm of Symmetric Functions. - Anil Ada; Omar Fawzi; Hamed Hatami (APPROX-RANDOM, 2012)

The Hardness of Being Private. - Anil Ada; Arkadev Chattopadhyay; Stephen A. Cook; Lila Fontes; Michal Koucký 001; Toniann Pitassi (ACM Trans. Comput. Theory, 2014)

The NOF Multiparty Communication Complexity of Composed Functions. - Anil Ada; Arkadev Chattopadhyay; Omar Fawzi; Phuong Nguyen 001 (Comput. Complex., 2015)

On the Spectral Properties of Symmetric Functions. - Anil Ada; Omar Fawzi; Raghav Kulkarni (CoRR, 2017)