Calvin Ching-Yuen Chen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

1994

Efficient EREW PRAM Algorithms for Parentheses-MatchingSushil K. Prasad, Sajal K. Das, Calvin Ching-Yuen Chen. tpds, 5(9):995-1008, 1994. [doi]

1993

A Comprehensive Performance Evaluation of Crossbar NetworksHee Yong Youn, Calvin Ching-Yuen Chen. tpds, 4(5):481-489, 1993. [doi]

1992

Efficient Parallel Algorithms for Computing Articulation Points and Bridges of Interval GraphsCalvin Ching-Yuen Chen, Sajal K. Das. icpp 1992: 164-167

Breadth-First Traversal of Trees and Integer Sorting in ParallelCalvin Ching-Yuen Chen, Sajal K. Das. ipl, 41(1):39-49, 1992.

A New Parallel Algorithm for Breadth-First Search on Interval GraphsSajal K. Das, Calvin Ching-Yuen Chen. ipps 1992: 150-153

Efficient Parallel Algorithms on Interval GraphsSajal K. Das, Calvin Ching-Yuen Chen. parle 1992: 131-143

1991

A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAMCalvin Ching-Yuen Chen, Sajal K. Das. ipps 1991: 132-137

Breadth-First Traversal of Trees and Integer Sorting in ParallelCalvin Ching-Yuen Chen, Sajal K. Das. icpp 1991: 50-57

A Unified Approach to Parallel Depth-First Traversals of General TreesCalvin Ching-Yuen Chen, Sajal K. Das, Selim G. Akl. ipl, 38(1):49-55, 1991.

Some Fast Parallel Algorithms for Parentheses MatchingSajal K. Das, Calvin Ching-Yuen Chen, Gene Lewis, Sushil K. Prasad. icci 1991: 443-454

1990

A comprehensive modeling for performance evaluation of regular interconnection networkCalvin Ching-Yuen Chen, Hee Yong Youn. spdp 1990: 768-775 [doi]

Parallel Breadth-First and Breadth-Depth Traversals of Generated TreesCalvin Ching-Yuen Chen, Sajal K. Das. icci 1990: 395-404

Sign in or sign up to see more results.

runs on WebDSL