default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZ. George Mou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i1]Z. George Mou:
Black-White Array: A New Data Structure for Dynamic Data Sets. CoRR abs/2004.09051 (2020)
1990 – 1999
- 1999
- [c13]Z. George Mou, Lien Duong, Denis Donohue:
BORG: Brokered Objects for Ragged-Network Gigaflops. Applied Informatics 1999: 72-75 - [c12]Z. George Mou:
Recursive Individually Distributed Object. IPPS/SPDP Workshops 1999: 63-78 - 1996
- [c11]Z. George Mou:
Comparison of Multiprocessor Networks with the Same Cost. PDPTA 1996: 539-548 - 1995
- [c10]Z. George Mou, Sevan G. Ficici:
A Scalable Divide-and-Conquer Parallel Algorithm for Finite State Automata and Its Applications. PP 1995: 193-194 - [c9]Z. George Mou:
A Divide-and-Conquer Parallel Algorithm for Banded Linear Systems. PP 1995: 514-515 - [c8]Z. George Mou:
CAL: A Cellular Automata Language. PP 1995: 722-727 - 1993
- [c7]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 - [c6]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
- [c5]A. J. Huang, Z. George Mou:
Parallel Partition Expansion for the Solution of Arbitrary Recurrences. ICPP (3) 1992: 109-113 - 1991
- [j1]Bruno Carpentieri
, Z. George Mou:
Compile-time transformations and optimization of parallel Divide-and-Conquer algorithms. ACM SIGPLAN Notices 26(10): 19-28 (1991) - [c4]Z. George Mou, Marc Goodman:
A Comparison of Communication Costs for Three Parallel Programming Paradigms of Hypercube and Mesh Architectures. PP 1991: 491-500 - [c3]Marc Goodman, Z. George Mou:
DC Transpose: a method for reducing communication in divide-and-conquer algorithms on mesh-based computers. SPDP 1991: 218-221 - [c2]Xiaojing Wang, Z. George Mou:
A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers. SPDP 1991: 810-817
1980 – 1989
- 1989
- [c1]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. PP 1989: 386-387
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
