Communication-space tradeoffs for unrestricted protocols. Anne Condon, Lisa Hellerstein, Samuel Pottle, and Avi Wigderson. On the power of finite automata with both nondeterministic and probabilistic states. Anne Condon, Lisa Hellerstein, Samuel Pottle, and Avi Wigderson. Rudolf Fleischer, Hermann Jung, and Kurt Mehlhorn.
Geometric arguments yield better bounds for threshold circuits and distributed computing.
Ilan Kremer, Noam Nissan, and Dana Ron. On randomized one-round communication complexity. Richard J. Lipton and Neal E. Young. Simple strategies for large zero-sum games with applications to complexity theory. P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman.