The Spectrum of Small DeMorgan Formulas. - Anat Ganor; Ilan Komargodski; Ran Raz (Electron. Colloquium Comput. Complex., 2012)

Space Pseudorandom Generators by Communication Complexity Lower Bounds. - Anat Ganor; Ran Raz (Electron. Colloquium Comput. Complex., 2013)

Two Sides of the Coin Problem. - Gil Cohen; Anat Ganor; Ran Raz (Electron. Colloquium Comput. Complex., 2014)

Exponential Separation of Information and Communication. - Anat Ganor; Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2014)

Exponential Separation of Information and Communication for Boolean Functions. - Anat Ganor; Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2014)

Communication Complexity of Correlated Equilibrium in Two-Player Games. - Anat Ganor; Karthik C. S. 001 (Electron. Colloquium Comput. Complex., 2017)

Communication Complexity of Correlated Equilibrium with Small Support. - Anat Ganor; Karthik C. S. 001 (APPROX-RANDOM, 2018)

A Candidate for a Strong Separation of Information and Communication. - Mark Braverman; Anat Ganor; Gillat Kol; Ran Raz (ITCS, 2018)

Exponential Separation of Communication and External Information. - Anat Ganor; Gillat Kol; Ran Raz (SIAM J. Comput., 2021)

On Communication Complexity of Fixed Point Computation. - Anat Ganor; Karthik C. S. 001; Dömötör Pálvölgyi (ACM Trans. Economics and Comput., 2021)