Остановите войну!
for scientists:
default search action
Qian-Ping Gu
- > Home > Persons > Qian-Ping Gu
Publications
- 2003
- [j25]Qian-Ping Gu, Shietung Peng:
Multihop All-to-All Broadcast on WDM Optical Networks. IEEE Trans. Parallel Distributed Syst. 14(5): 477-486 (2003) - 2001
- [c16]Qian-Ping Gu, Shietung Peng:
Multi-hop All-to-All Broadcast on WDM Optical Networks. ICPP Workshops 2001: 291-296 - 2000
- [j22]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. J. Parallel Distributed Comput. 60(6): 764-774 (2000) - [j21]Qian-Ping Gu, Shietung Peng:
Cluster fault-tolerant routing in star graphs. Networks 35(1): 83-90 (2000) - [c15]Qian-Ping Gu, Shietung Peng:
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. ICPP 2000: 513-520 - [c14]Qian-Ping Gu, Shietung Peng:
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. IPDPS 2000: 761-768 - 1999
- [j19]Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough:
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. 210(2): 327-339 (1999) - [j18]Qian-Ping Gu, Shietung Peng:
Unicast in Hypercubes with Large Number of Faulty Nodes. IEEE Trans. Parallel Distributed Syst. 10(10): 964-975 (1999) - 1998
- [j17]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. Inf. Process. Lett. 67(6): 283-287 (1998) - [j16]Qian-Ping Gu, Shietung Peng:
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Comput. 24(8): 1245-1261 (1998) - [c13]Qian-Ping Gu, Shietung Peng:
Routing in Hypercubes with Large Number of Faulty Nodes. ICPADS 1998: 718- - [c12]Qian-Ping Gu, Shietung Peng:
Cluster Fault Tolerant Routing in Hypercubes. ICPP 1998: 148-155 - 1997
- [j15]Qian-Ping Gu, Shietung Peng:
Node-To-Set Disjoint Paths Problem in Star Graphs. Inf. Process. Lett. 62(4): 201-207 (1997) - [j13]Qian-Ping Gu, Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. IEEE Trans. Computers 46(9): 1042-1049 (1997) - [c10]Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. ISPAN 1997: 404-409 - 1996
- [j12]Qian-Ping Gu, Shietung Peng:
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. Comput. J. 39(1): 14-19 (1996) - [j11]Qian-Ping Gu, Shietung Peng:
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. Comput. J. 39(7): 626-629 (1996) - [j10]Qian-Ping Gu, Shietung Peng:
Fault Tolerant Routing in Hypercubes and Star Graphs. Parallel Process. Lett. 6(1): 127-136 (1996) - [c8]Qian-Ping Gu, Shietung Peng:
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. ICPADS 1996: 98-105 - 1995
- [j8]Qian-Ping Gu, Shietung Peng:
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. IEICE Trans. Inf. Syst. 78-D(9): 1171-1177 (1995) - [j7]Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. Inf. Process. Lett. 56(1): 29-35 (1995) - [c6]Qian-Ping Gu, Shietung Peng:
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. Parallel and Distributed Computing and Systems 1995: 229-233 - [c5]Qian-Ping Gu, Shietung Peng:
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. SPDP 1995: 673-680 - 1994
- [c4]Qian-Ping Gu, Shietung Peng:
Algorithms for Node Disjoint Paths in Incomplete Star Networks. ICPADS 1994: 296-303 - [c2]Qian-Ping Gu, Shietung Peng:
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ISAAC 1994: 342-350 - [c1]Qian-Ping Gu, Shietung Peng:
Advanced fault tolerant routing in hypercubes. ISPAN 1994: 189-196
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-01-05 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint