Z. George Mou

According to our database, Z. George Mou authored at least 15 papers between 1989 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Black-White Array: A New Data Structure for Dynamic Data Sets.

Z. George Mou

CoRR, 2020

1999

Recursive Individually Distributed Object.

Z. George Mou

Proceedings of the Parallel and Distributed Processing, 1999

BORG: Brokered Objects for Ragged-Network Gigaflops.

Z. George Mou, Lien Duong, Denis Donohue

Proceedings of the 17th IASTED International Conference on Applied Informatics, 1999

1996

Comparison of Multiprocessor Networks with the Same Cost.

Z. George Mou

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

1995

A Scalable Divide-and-Conquer Parallel Algorithm for Finite State Automata and Its Applications.

Z. George Mou, Sevan G. Ficici

Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

CAL: A Cellular Automata Language.

Z. George Mou

Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

A Divide-and-Conquer Parallel Algorithm for Banded Linear Systems.

Z. George Mou

Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

1993

Divide-and-Conquer Algorithms with Recursive Broadcast Communication on Reconfigurable Arbitrary Dimensional Mesh.

Z. George Mou, Xiaojing Wang, Timothy J. Hickey

Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993

Optimal Mappings of m Dimensional FFT Communication to k Dimensional Mesh for Arbitrary m and k.

Z. George Mou, Xiaojing Wang

Proceedings of the PARLE '93, 1993

1992

Parallel Partition Expansion for the Solution of Arbitrary Recurrences.

A. J. Huang, Z. George Mou

Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991

Compile-time transformations and optimization of parallel Divide-and-Conquer algorithms.

Bruno Carpentieri, Z. George Mou

ACM SIGPLAN Notices, 1991

A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers.

Xiaojing Wang, Z. George Mou

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

DC Transpose: a method for reducing communication in divide-and-conquer algorithms on mesh-based computers.

Marc Goodman, Z. George Mou

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

A Comparison of Communication Costs for Three Parallel Programming Paradigms of Hypercube and Mesh Architectures.

Z. George Mou, Marc Goodman

Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991

1989

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

Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, 1989