Noga Alon Noga Alon Noga Alon and V. D. Milman. Geometrical realization of set systems and probabilistic communication complexity. Noga Alon and Wolfgang Maass. Meanders, Ramsey theory and lower bounds for branching programs. Noga Alon, Yossi Azar, and Uzi Vishkin.
Tight complexity bounds for parallel comparison sorting.
N. Alon and Y. Azar. The average complexity of deterministic and randomized parallel comparison sorting algorithms. N. Alon and Y. Azar. Parallel comparison algorithms for approximation problems. Noga Alon and Moni Naor.