63 citations · 65 across the 3 of their papers we have counts for
3 papers
cs.CC2008★ 63 cited
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…
cs.CC2008★ 1 cited
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…
cs.CG2006★ 1 cited
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…