Bing Yang

According to our database, Bing Yang authored at least 13 papers between 2004 and 2010.

Collaborative distances:

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

2010

Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network.

S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang

IEEE/ACM Trans. Netw., 2010

2008

Design and Performance Evaluation of Sequence Partition Algorithms.

Bing Yang, Jing Chen, Enyue Lu, Si-Qing Zheng

J. Comput. Sci. Technol., 2008

Fault Tolerant Service Composition in Service Overlay Networks.

Jin Wang, Jianping Wang, Naijie Gu, Bing Yang

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007

A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences.

Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng

Proceedings of the Theory and Applications of Models of Computation, 2007

Finding Minimum-Cost Paths with Minimum Sharability.

Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function.

Bing Yang, S. Q. Zheng, Enyue Lu

Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2006

Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.

Bing Yang, S. Q. Zheng

Proceedings of the Theory and Applications of Models of Computation, 2006

Message Scheduling on a Wormhole-Switched Linear Client-Server Network.

Bing Yang, Ashwin Gumaste, Enyue Lu, Si-Qing Zheng

Proceedings of the ISCA 19th International Conference on Parallel and Distributed Computing Systems, 2006

2005

A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks.

Enyue Lu, S. Q. Zheng, Bing Yang

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

Finding Two Disjoint Paths in a Network with Normalized alpha-MIN-SUM Objective Function.

Bing Yang, S. Q. Zheng, Enyue Lu

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications.

Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Finding Two Disjoint Paths in a Network with Normalized <i>alpha</i>⁺-MIN-SUM Objective Function.

Bing Yang, S. Q. Zheng, Enyue Lu

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A class of self-routing strictly nonblocking photonic switching networks.

Enyue Lu, Mei Yang, Bing Yang, S. Q. Zheng

Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004