1. Lecture Notes in Computer Science;D. Bader,2001
2. Lecture Notes in Computer Science;D. Bader,2002
3. Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In: Proc. Int’l. Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)
4. Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: Proc. Int’l. Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)
5. Lin, B., Newton, A.: Synthesis of multiple level logic from symbolic high-level description language. In: Proc. of the IFIP TC 10/WG 10.5 Int’l. Conf. on Very Large Scale Integration, Germany, pp. 414–417 (1989)