1. Nearly complete graphs decomposable into large induced matchings and their applications;Alon,2012
2. The cost of the missing bit: communication complexity with help;Babai;Combinatorica,2001
3. Separating deterministic from randomized multiparty communication complexity;Beame,2007
4. The multiparty communication complexity of Exact-T: improved bounds and new problems;Beigel,2006
5. Multi-party protocols;Chandra,1983