1. Miklós Ajtai , János Komlós , and Endre Szemerédi . 1983 . An O(n log n) sorting network . In Proceedings of the fifteenth annual ACM symposium on Theory of computing. 1--9. Miklós Ajtai, János Komlós, and Endre Szemerédi. 1983. An O(n log n) sorting network. In Proceedings of the fifteenth annual ACM symposium on Theory of computing. 1--9.
2. Noga Alon and Joel H Spencer . 2016. The probabilistic method . John Wiley & Sons . Noga Alon and Joel H Spencer. 2016. The probabilistic method. John Wiley & Sons.
3. Yair Bartal and Stefano Leonardi . 1997 . On-Line Routing in All-Optical Networks. In Automata, Languages and Programming , 24th International Colloquium, ICALP'97 , Bologna, Italy, 7- -11 July 1997, Proceedings (Lecture Notes in Computer Science, Vol. 1256), Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela (Eds.). Springer, 516-- 526 . 10.1007/3-540-63165-8_207 Yair Bartal and Stefano Leonardi. 1997. On-Line Routing in All-Optical Networks. In Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7--11 July 1997, Proceedings (Lecture Notes in Computer Science, Vol. 1256), Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela (Eds.). Springer, 516--526. 10.1007/3-540-63165-8_207
4. A practical algorithm for constructing oblivious routing schemes
5. Routing, merging, and sorting on parallel models of computation