1. Randomized parallel communication;Aleliunas;Proc. 1st Symp. on Principles of Distributed Computing,1982
2. An O(n log n) sorting network;Ajtai;Proc. 15th Symp. on Theory of Computing,1983
3. The Art of Computer Programming;Knuth,1973
4. Tight bounds on the complexity of parallel sorting;Leighton;Proc. 16th Symp. on Theory of Computing,1984
5. Ramanugan conjecture and explicit constructions of expanders;Lubotzky;Proc. 18th Symp. on Theory of Computing,1986