 | 1994 |
|---|
| 12 |       | Sushil K. Prasad,
Sajal K. Das,
Calvin Ching-Yuen Chen:
Efficient EREW PRAM Algorithms for Parentheses-Matching.
IEEE Trans. Parallel Distrib. Syst. 5(9): 995-1008 (1994) |
| 1993 |
|---|
| 11 | | Hee Yong Youn,
Calvin Ching-Yuen Chen:
A Comprehensive Performance Evaluation of Crossbar Networks.
IEEE Trans. Parallel Distrib. Syst. 4(5): 481-489 (1993) |
| 1992 |
|---|
| 10 |  | Calvin Ching-Yuen Chen,
Sajal K. Das:
Efficient Parallel Algorithms for Computing Articulation Points and Bridges of Interval Graphs.
ICPP (3) 1992: 164-167 |
| 9 | | Sajal K. Das,
Calvin Ching-Yuen Chen:
A New Parallel Algorithm for Breadth-First Search on Interval Graphs.
IPPS 1992: 150-153 |
| 8 | | Sajal K. Das,
Calvin Ching-Yuen Chen:
Efficient Parallel Algorithms on Interval Graphs.
PARLE 1992: 131-143 |
| 7 | | Calvin Ching-Yuen Chen,
Sajal K. Das:
Breadth-First Traversal of Trees and Integer Sorting in Parallel.
Inf. Process. Lett. 41(1): 39-49 (1992) |
| 1991 |
|---|
| 6 | | Sajal K. Das,
Calvin Ching-Yuen Chen,
Gene Lewis,
Sushil K. Prasad:
Some Fast Parallel Algorithms for Parentheses Matching.
ICCI 1991: 443-454 |
| 5 | | Calvin Ching-Yuen Chen,
Sajal K. Das:
Breadth-First Traversal of Trees and Integer Sorting in Parallel.
ICPP (3) 1991: 50-57 |
| 4 | | Calvin Ching-Yuen Chen,
Sajal K. Das:
A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAM.
IPPS 1991: 132-137 |
| 3 | | Calvin Ching-Yuen Chen,
Sajal K. Das,
Selim G. Akl:
A Unified Approach to Parallel Depth-First Traversals of General Trees.
Inf. Process. Lett. 38(1): 49-55 (1991) |
| 1990 |
|---|
| 2 | | Calvin Ching-Yuen Chen,
Sajal K. Das:
Parallel Breadth-First and Breadth-Depth Traversals of Generated Trees.
ICCI 1990: 395-404 |
| 1 | | Calvin Ching-Yuen Chen,
Hee Yong Youn:
A comprehensive modeling for performance evaluation of regular interconnection network.
SPDP 1990: 768-775 |
Data released under the ODC-BY 1.0 license — See also our legal information page