default search action
Zhaofang Wen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c9]Ron Brightwell, Mike Heroux
, Zhaofang Wen, Junfeng Wu:
Parallel Phase Model: A Programming Model for High-end Parallel Machines with Manycores. ICPP 2009: 92-99 - 2008
- [c8]Mike Heroux
Initial Experiences with the BEC Parallel Programming Environment. ISPDC 2008: 205-212 - 2006
- [c7]Jonathan Leighton Brown, Sue Goudy, Mike Heroux
An envolutionary path towards virtual shared memory with random access. SPAA 2006: 117 - 2005
- [c6]Jonathan Leighton Brown, Zhaofang Wen:
Toward an Application Support Layer: Numerical Computation in Unified Parallel C. PPAM 2005: 912-919
1990 – 1999
- 1996
- [j12]Zhaofang Wen:
Multiway Merging in Parallel. IEEE Trans. Parallel Distributed Syst. 7(1): 11-17 (1996) - 1995
- [j11]Stephan Olariu, C. Michael Overstreet, Zhaofang Wen:
Reconstructing a Binary Tree from its Traversals in Doubly. J. Parallel Distributed Comput. 27(1): 100-105 (1995) - [j10]Zhaofang Wen:
Fast Parallel Algorithms for the Maximum Sum Problem. Parallel Comput. 21(3): 461-466 (1995) - 1994
- [j9]Zhaofang Wen:
New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem. Inf. Process. Lett. 51(1): 11-16 (1994) - 1993
- [c5]Zhaofang Wen:
Merging Multiple Lists in O(log n) Time. ICPP (3) 1993: 205-208 - 1992
- [j8]Stephan Olariu, Zhaofang Wen:
An optimal parallel algorithm to construct a deap. Int. J. Comput. Math. 42(1-2): 61-65 (1992) - [j7]Stephan Olariu, Zhaofang Wen:
A Parallel Algorithm for Forest Reconstruction. Parallel Process. Lett. 2: 157-160 (1992) - 1991
- [b1]Zhaofang Wen:
Fast Parallel Algorithms for Basic Problems. Old Dominion University, Norfolk, Virginia, USA, 1991 - [j6]Stephan Olariu, C. Michael Overstreet, Zhaofang Wen:
A Mergeable Double-Ended Priority Queue. Comput. J. 34(5): 423-427 (1991) - [j5]Stephan Olariu, Zhaofang Wen:
Merging heaps in parallel. Int. J. Comput. Math. 39(1-2): 61-65 (1991) - [j4]Zhaofang Wen:
Parallel Multiple Search. Inf. Process. Lett. 37(4): 181-186 (1991) - [j3]Stephan Olariu, Zhaofang Wen, Wei Xiong Zhang
A faster optimal algorithm for the measure problem. Parallel Comput. 17(6-7): 683-687 (1991) - [j2]Stephan Olariu, Zhaofang Wen:
An efficient parallel algorithm for multiselection. Parallel Comput. 17(6-7): 689-693 (1991) - [j1]Stephan Olariu, Zhaofang Wen:
Optimal Parallel Initialization Algorithms for a Class of Priority Queues. IEEE Trans. Parallel Distributed Syst. 2(4): 423-429 (1991) - [c4]Stephan Olariu, James L. Schwing, Zhaofang Wen, Jingyuan Zhang:
Optimal parallel encoding and decoding algorithms for trees. ACM Conference on Computer Science 1991: 1-10 - [c3]Wei Xiong Zhang
Efficient parallel algorithms for some integer problems. ACM Conference on Computer Science 1991: 11-20 - [c2]Stephan Olariu, C. Michael Overstreet, Zhaofang Wen:
An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. ICCI 1991: 484-495 - [c1]Zhaofang Wen:
Parallel Multiple Search. IPPS 1991: 114-119
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-04-24 23:03 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: