Balanced Divide-and-Conquer Algorithms for the Fine-Grained Parallel Direct Solution of Dense and Banded Triangular Linear Systems and their Connection Machine Implementation. - Z. George Mou; David E. Keyes; William Gropp (PP, 1989)

A Comparison of Communication Costs for Three Parallel Programming Paradigms of Hypercube and Mesh Architectures. - Z. George Mou; Marc Goodman (PP, 1991)

DC Transpose: a method for reducing communication in divide-and-conquer algorithms on mesh-based computers. - Marc Goodman; Z. George Mou (SPDP, 1991)

A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers. - Xiaojing Wang; Z. George Mou (SPDP, 1991)

Compile-time transformations and optimization of parallel Divide-and-Conquer algorithms. - Bruno Carpentieri; Z. George Mou (ACM SIGPLAN Notices, 1991)

Parallel Partition Expansion for the Solution of Arbitrary Recurrences. - A. J. Huang; Z. George Mou (ICPP (3), 1992)

Optimal Mappings of m Dimensional FFT Communication to k Dimensional Mesh for Arbitrary m and k. - Z. George Mou; Xiaojing Wang (PARLE, 1993)

Divide-and-Conquer Algorithms with Recursive Broadcast Communication on Reconfigurable Arbitrary Dimensional Mesh. - Z. George Mou; Xiaojing Wang; Timothy J. Hickey (PPSC, 1993)

A Divide-and-Conquer Parallel Algorithm for Banded Linear Systems. - Z. George Mou (PP, 1995)

CAL: A Cellular Automata Language. - Z. George Mou (PP, 1995)

A Scalable Divide-and-Conquer Parallel Algorithm for Finite State Automata and Its Applications. - Z. George Mou; Sevan G. Ficici (PP, 1995)

Comparison of Multiprocessor Networks with the Same Cost. - Z. George Mou (PDPTA, 1996)

BORG: Brokered Objects for Ragged-Network Gigaflops. - Z. George Mou; Lien Duong; Denis Donohue (Applied Informatics, 1999)

Recursive Individually Distributed Object. - Z. George Mou (IPPS/SPDP Workshops, 1999)

Black-White Array: A New Data Structure for Dynamic Data Sets. - Z. George Mou (CoRR, 2020)