[1] C.-M. Wang and S.-D. Wang, “Structured Partitioning of Concurrent Programs for Execution on Multiprocessors,” Parallel Computing, Vol. 16, No. 1, pp. 41-57, November 1990.
[2] C.-M. Wang and S.-D. Wang, “Extract Parallelism within a Nested Loop by Cycle Breaking and Loop Reordering,” Proceedings of the First Workshop on Parallel Processing, pp. 144-152, Hsinchu, Taiwan, December 1990.
[3] C.-M. Wang and S.-D. Wang, “A Scheduling Scheme for Efficiently Executing Hybrid Nested Loops,” Proceedings of the 1991 International Conference on Parallel Processing, Vol. II, pp. 260-261, St. Charles, IL, August 1991.
[4] C.-M. Wang and S.-D. Wang, “Compiler Techniques to Extract Parallelism within a Nested Loop,” Proceedings of the Fifteenth Annual International Computer Software and Applications Conference, pp. 24-29, Tokyo, Japan, September 1991.
[5] S.-D. Wang and C.-M. Wang, “Compiler Techniques for Extracting Loop-Level Parallelism,” Journal of Information Science and Engineering, Vol. 7, No. 4, pp. 543-563, December 1991.
[6] C.-M. Wang and S.-D. Wang, “Efficient Processor Assignment Algorithms and Loop Transformations for Executing Nested Parallel Loops on Multiprocessors,” IEEE Transactions on Parallel and Distributed Systems, Vol. 3, No. 1, pp. 71-82, January 1992.
[7] C.-M. Wang and S.-D. Wang, “A Hybrid Scheme for Efficiently Executing Nested Loops on Multiprocessors,” Parallel Computing, Vol. 18, No. 6, pp. 625-637, June 1992.
[8] C.-M. Wang, “Efficient Link-Disjoint Routing of Cyclic Shifts on BRGC Hypercubes,” Proceedings of the 1993 International Conference on Parallel and Distributed Systems, pp. 689-693, Taipei, Taiwan, December 1993.
[9] C.-M. Wang, “A New Routing Algorithm for Cyclic Shifts on BRGC Hypercubes,” Information Processing Letters, Vol. 49, No. 4, pp. 165-169, February 1994.
[10] Y.-S. Chen, S.-D. Wang and C.-M. Wang, “Compiler Techniques for Maximizing Fine-grain and Coarse-grain Parallelism in Loops with Uniform Dependences,” Proceedings of the 1994 ACM International Conference on Supercomputing, pp. 204-213, Manchester, England, July 1994. (Note: Paper acceptance rate is 39%.)
[11] C.-M. Wang and C.-Y. Ku, “A Near-Optimal Broadcasting Algorithm in All-Port Wormhole-Routed Hypercubes,” Proceedings of the 1995 ACM International Conference on Supercomputing, pp. 147-153, Barcelona, Spain, July 1995. (Note: Paper acceptance rate is 41%.)
[12] C.-M. Wang and Y.-S. Kuo, “Class Exerciser: a Basic Tool for Object-Oriented Development,” Proceedings of the 1995 Asia-Pacific Software Engineering Conference, pp. 108-116, Brisbane, Australia, December 1995. (Note: Paper acceptance rate is 33%.)
[13] C.-M. Wang, Y.-M. Hou and C.-Y. Ku, “Minimizing Link Contention of Linear-Complement Permutations on Hypercubes by Processor Reordering Mapping,” Proceedings of the Second Workshop on Compiler Techniques for High-Performance Computing, pp. 171-178, Taipei, Taiwan, March 1996.
[14] Y.-S. Chen, S.-D. Wang and C.-M. Wang, “Tiling Nested Loops into Maximal Rectangular Blocks,” Journal of Parallel and Distributed Computing, Vol. 35, No. 2, pp. 123-132, June 1996.
[15] C.-M. Wang, Y.-M. Hou and C.-Y. Ku, “Optimal Processor Mapping for Linear-Constant Communication on k-ary n-cubes,” Proceedings of International Conference on Computer Architecture, pp. 65-73, Kaohsiung, Taiwan, December 1996.
[16] C.-C. Hsu, C.-M. Wang and J.-F. Lin, “Efficient Loop Allocation Based on the Analysis of Processor Requirement of Loops with Equivalent Completion Times,” Computer Systems Science and Engineering, Vol. 12, No. 1, pp. 53-60, January 1997.
[17] C.-M. Wang, Y. Hou and C.-Y. Ku, “Compiler Techniques for Minimizing Link Contention of Linear-Constant Communication on k-ary n-cubes,” Journal of Information Science and Engineering, Vol. 14, No. 1, pp. 53-78, March 1998.
[18] T.-R. Chuang, Y.-S. Kuo and C.-M. Wang, “Non-Intrusive Object Introspection in C++ -- Architecture and Application,” Proceedings of the 20th International Conference on Software Engineering, pp. 312-321, Kyoto, Japan, April 1998. (Note: Paper acceptance rate is 20%.)
[19] Y. Hou, C.-M. Wang and L.-H. Hsu, “Depth Contention-Free Broadcasting on Torus Networks,” Proceedings of the 1998 ACM International Conference on Supercomputing, pp. 393-400, Melbourne, Australia, July 1998. (Note: Paper acceptance rate is 47%.)
[20] Y. Hou, C.-M. Wang, M.-J. Tsai and L.-H. Hsu, “Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size,” Proceedings of the 1998 International Conference on Parallel and Distributed Systems, pp. 334-341, Tainan, Taiwan, December 1998.
[21] Y. Hou, C.-M. Wang and L.-H. Hsu. “Efficient Broadcast Schemes for Wormhole-Routed 2D Meshes and Tori,” Proceedings of the Eleventh IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 719-724, Cambridge, Massachusetts, USA, November 1999.
[22] Y. Hou, C.-M. Wang, C.-Y. Ku and L.-H. Hsu, “Optimal Processor Mapping for Linear-Complement Communication on Hypercubes,” IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 5, pp. 514-527, May 2001.
[23] W.-C. Fang, C.-C. Hsu and C.-M. Wang, “On the Fault-Tolerant Embeddings of Complete Binary Trees,” Proceedings of the second International Conference on Parallel and Distributed Computing, Applications, and Technologies, Taipei, Taiwan, July 2001.
[24] J.-Y. Huang, Y.-C. Du and C.-M. Wang, “Design of the Server Cluster for the Scalable Networked Virtual Environment,” Proceedings of the 2001 National Computer Symposium, Taipei, Taiwan, December 2001.
[25] T.-R. Chuang, Y.-S. Kuo and C.-M. Wang, “Non-intrusive Object Introspection in C++,” Software: Practice and Experience, No. 32, Vol. 2, pp. 191-207, February 2002.
[26] C.-M. Wang, Y. Hou and L.-H. Hsu, “Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes,” Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, August 2002. [Paper (PDF) ] The proceedings also appears as Lecture Notes in Computer Science 2400, Springer 2002, ISBN 3-540-44049-6. (Note: Regular paper acceptance rate is 25%.)
[27] J.-Y. Huang, Y.-C. Du and C.-M. Wang, “Design of the Server Cluster to Support Avatar Migration,” Proceedings of IEEE Virtual Reality Conference 2003, pp. 7-14, Los Angeles, California, USA, March 2003. (Note: Paper acceptance rate is 28%.)
[28] W.-C. Fang, C.-C. Hsu and C.-M. Wang, “On the Fault-Tolerant Embeddings of Complete Binary Trees in the Mesh Interconnection Networks,” Information Sciences, Vol. 151, pp. 51-70, May 2003.