63 citations · 73 across the 5 of their papers we have counts for
5 papers
On the Spectral Properties of Symmetric Functions
Anil Ada, Omar Fawzi, Raghav Kulkarni
We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the…
Spectral Norm of Symmetric Functions
Anil Ada, Omar Fawzi, Hamed Hatami
The spectral norm of a Boolean function is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower boun…
Multiparty Communication Complexity of Disjointness
Arkadev Chattopadhyay, Anil Ada
We obtain a lower bound of n^Omega(1) on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of multiparty communicat…
Non-Deterministic Communication Complexity of Regular Languages
Anil Ada
In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complex…
On Bus Graph Realizability
Anil Ada, Melanie Coggan, Paul Di Marco +8
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1; V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a tw…