| 1999 |
|---|
| 12 | | Z. George Mou,
Lien Duong,
Denis Donohue:
BORG: Brokered Objects for Ragged-Network Gigaflops.
Applied Informatics 1999: 72-75 |
| 11 | | Z. George Mou:
Recursive Individually Distributed Object.
IPPS/SPDP Workshops 1999: 63-78 |
| 1996 |
|---|
| 10 | | Z. George Mou:
Comparison of Multiprocessor Networks with the Same Cost.
PDPTA 1996: 539-548 |
| 1995 |
|---|
| 9 | | Z. George Mou,
Sevan G. Ficici:
A Scalable Divide-and-Conquer Parallel Algorithm for Finite State Automata and Its Applications.
PPSC 1995: 193-194 |
| 8 | | Z. George Mou:
A Divide-and-Conquer Parallel Algorithm for Banded Linear Systems.
PPSC 1995: 514-515 |
| 7 | | Z. George Mou:
CAL: A Cellular Automata Language.
PPSC 1995: 722-727 |
| 1993 |
|---|
| 6 | | Z. George Mou,
Xiaojing Wang:
Optimal Mappings of m Dimensional FFT Communication to k Dimensional Mesh for Arbitrary m and k.
PARLE 1993: 104-119 |
| 5 | | Z. George Mou,
Xiaojing Wang,
Timothy J. Hickey:
Divide-and-Conquer Algorithms with Recursive Broadcast Communication on Reconfigurable Arbitrary Dimensional Mesh.
PPSC 1993: 784-787 |
| 1992 |
|---|
| 4 | | A. J. Huang,
Z. George Mou:
Parallel Partition Expansion for the Solution of Arbitrary Recurrences.
ICPP (3) 1992: 109-113 |
| 1991 |
|---|
| 3 | | Z. George Mou,
Marc Goodman:
A Comparison of Communication Costs for Three Parallel Programming Paradigms of Hypercube and Mesh Architectures.
PPSC 1991: 491-500 |
| 2 | EE | Bruno Carpentieri,
Z. George Mou:
Compile-time transformations and optimization of parallel Divide-and-Conquer algorithms.
SIGPLAN Notices 26(10): 19-28 (1991) |
| 1989 |
|---|
| 1 | | Z. George Mou,
David E. Keyes,
William Gropp:
Balanced Divide-and-Conquer Algorithms for the Fine-Grained Parallel Direct Solution of Dense and Banded Triangular Linear Systems and their Connection Machine Implementation.
PPSC 1989: 386-387 |
