1. New connectivity and MSF algorithms for shuffle-exchange network and PRAM;Awerbuch;IEEE Trans. Comput.,1987
2. D.A. Bader, G. Cong, A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs), in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, NM, April 2004.
3. D.A. Bader, A.K. Illendula, B.M.E. Moret, N. Weisse-Bernstein, Using PRAM algorithms on a uniform-memory-access shared-memory architecture, in: G.S. Brodal, D. Frigioni, A. Marchetti-Spaccamela (Eds.), Proceedings of the Fifth International Workshop on Algorithm Engineering (WAE 2001), Århus, Denmark, Lecture Notes in Computer Science, vol. 2141, Springer, Berlin, 2001, pp. 129–144.
4. SIMPLE: a methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs);Bader;J. Parallel Distrib. Comput.,1999
5. D.A. Bader, S. Sreshta, N. Weisse-Bernstein, Evaluating arithmetic expressions using tree contraction: a fast and scalable parallel implementation for symmetric multiprocessors (SMPs), in: S. Sahni, V.K. Prasanna, U. Shukla (Eds.), Proceedings of the Ninth International Conference on High Performance Computing (HiPC 2002), Bangalore, India, Lecture Notes in Computer Science, vol. 2552, Springer, Berlin, December 2002, pp. 63–75.