Bing Yang

Affiliations:
  • Cisco Systems, Richardson, TX, USA
  • University of Texas at Dallas, Richardson, TX, USA (PhD 2005)


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network.
IEEE/ACM Trans. Netw., 2010

2008
Design and Performance Evaluation of Sequence Partition Algorithms.
J. Comput. Sci. Technol., 2008

Fault Tolerant Service Composition in Service Overlay Networks.
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.
Proceedings of the Theory and Applications of Models of Computation, 2007

Finding Minimum-Cost Paths with Minimum Sharability.
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.
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.
Proceedings of the Theory and Applications of Models of Computation, 2006

Message Scheduling on a Wormhole-Switched Linear Client-Server Network.
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.
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.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Finding Two Disjoint Paths in a Network with Normalized <i>alpha</i><sup>+</sup>-MIN-SUM Objective Function.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
A class of self-routing strictly nonblocking photonic switching networks.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004


  Loading...