Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBing Yang 0001
Person information
- affiliation: Cisco Systems, Richardson, TX, USA
- affiliation (PhD 2005): University of Texas at Dallas, Richardson, TX, USA
Other persons with the same name
- Bing Yang — disambiguation page
- Bing Yang 0002 — Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
- Bing Yang 0003
![[0000-0001-8307-3683]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8307-3683")
— Shanghai Jiao Tong University, Institute of Image Communication and Network Engineering, Shanghai Key Laboratory of Digital Media Processing and Transmissions, China - Bing Yang 0004 — Peking University, Shenzhen Graduate School, Key Laboratory of Machine Perception, Beijing, China
- Bing Yang 0005 — Hefei University of Technology, School of Computer Science and Information Engineering, MoE Key Laboratory of Knowledge Engineering With Big Data, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j2]S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang:
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network. IEEE/ACM Trans. Netw. 18(5): 1436-1449 (2010)
2000 – 2009
- 2008
- [j1]Bing Yang, Jing Chen, Enyue Lu, Si-Qing Zheng:
Design and Performance Evaluation of Sequence Partition Algorithms. J. Comput. Sci. Technol. 23(5): 711-718 (2008) - [c11]Jin Wang, Jianping Wang, Naijie Gu, Bing Yang:
Fault Tolerant Service Composition in Service Overlay Networks. GLOBECOM 2008: 2442-2446 - 2007
- [c10]Bing Yang, S. Q. Zheng, Enyue Lu:
Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function. FCS 2007: 356-361 - [c9]Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang:
Finding Minimum-Cost Paths with Minimum Sharability. INFOCOM 2007: 1532-1540 - [c8]Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng:
A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. TAMC 2007: 46-57 - 2006
- [c7]Bing Yang, Ashwin Gumaste, Enyue Lu, Si-Qing Zheng:
Message Scheduling on a Wormhole-Switched Linear Client-Server Network. PDCS 2006: 146-151 - [c6]Bing Yang, S. Q. Zheng:
Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. TAMC 2006: 206-216 - 2005
- [c5]Bing Yang, S. Q. Zheng, Enyue Lu:
Finding Two Disjoint Paths in a Network with Normalized alpha+-MIN-SUM Objective Function. ISAAC 2005: 954-963 - [c4]Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng:
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. ISPAN 2005: 334-339 - [c3]Bing Yang, S. Q. Zheng, Enyue Lu:
Finding Two Disjoint Paths in a Network with Normalized alpha-MIN-SUM Objective Function. IASTED PDCS 2005: 342-348 - [c2]Enyue Lu, S. Q. Zheng, Bing Yang:
A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks. PDPTA 2005: 91-97 - 2004
- [c1]Enyue Lu, Mei Yang, Bing Yang, S. Q. Zheng:
A class of self-routing strictly nonblocking photonic switching networks. GLOBECOM 2004: 1011-1015
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-06-27 20:40 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:
