Sheng-Hsiung Chen

According to our database, Sheng-Hsiung Chen authored at least 6 papers between 2005 and 2013.

Collaborative distances:

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

2013

MANA: A Shortest Path Maze Algorithm Under Separation and Minimum Length NAnometer Rules.

Fong-Yuan Chang, Ren-Song Tsay, Wai-Kei Mak, Sheng-Hsiung Chen

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2013

A separation and minimum wire length constrained maze routing algorithm under nanometer wiring rules.

Fong-Yuan Chang, Ren-Song Tsay, Wai-Kei Mak, Sheng-Hsiung Chen

Proceedings of the 18th Asia and South Pacific Design Automation Conference, 2013

2011

Cut-demand based routing resource allocation and consolidation for routability enhancement.

Fong-Yuan Chang, Sheng-Hsiung Chen, Ren-Song Tsay, Wai-Kei Mak

Proceedings of the 16th Asia South Pacific Design Automation Conference, 2011

2009

Bounded-Bypass Mutual Exclusion with Minimum Number of Registers.

Sheng-Hsiung Chen, Ting-Lu Huang

IEEE Trans. Parallel Distributed Syst., 2009

2006

A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model.

Sheng-Hsiung Chen, Ting-Lu Huang

J. Parallel Distributed Comput., 2006

2005

A Fair and Space-ef.cient Mutual Exclusion.

Sheng-Hsiung Chen, Ting-Lu Huang

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