Jong-Chuang Tsay

According to our database1, Jong-Chuang Tsay authored at least 26 papers between 1981 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
More on the one-dimensional sliding-coin puzzle.
Discret. Appl. Math., 2014

2004
Designing A Systolic Algorithm For Generating Well-Formed Parenthesis Strings.
Parallel Process. Lett., 2004

2003
JTEAM: A Framework for Effective Teamwork of BDI-Based Agents.
Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 2003

1999
An Approach to Checking Link Conflicts in the Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays.
IEEE Trans. Computers, 1999

1998
An Approach to Designing Modular Extensible Linear Arrays for Regular Algorithms.
IEEE Trans. Computers, 1998

Finding Space-Optimal Linear Array for Uniform Dependence Algorithms with Arbitrary Convex Index Sets.
J. Inf. Sci. Eng., 1998

1997
Fully static processor-optimal assignment of data-flow graphs.
IEEE Signal Process. Lett., 1997

An Optimal Systolic Algorithm for the Set Partitioning Problem.
Parallel Algorithms Appl., 1997

1996
Timespace Mapping for Regular Arrays.
Parallel Algorithms Appl., 1996

Designing Lower-Dimensional Regular Arrays for Algorithms with Uniform Dependencies.
J. Parallel Distributed Comput., 1996

1995
Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure.
IEEE Trans. Parallel Distributed Syst., 1995

Design of Efficient Regular Arrays for Matrix Multiplication by Two-Step Regularization.
IEEE Trans. Parallel Distributed Syst., 1995

Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules.
IEEE Trans. Computers, 1995

A New Approach to Finding Optimal Linear Schedules for Uniform Dependence Algorithms.
Parallel Algorithms Appl., 1995

1994
A Family of Efficient Regular Arrays for Algebraic Path Problem.
IEEE Trans. Computers, 1994

An Optimal Parallel Algorithm for Generating Permutations in Minimal Change Order.
Parallel Comput., 1994

A Systolic Design for Generating Permutations in Lexicographic Order.
Parallel Comput., 1994

1992
Some Combinatorial Aspects of Parallel Algorithm Design for Matrix Multiplication.
IEEE Trans. Computers, 1992

On Equivalent Systolic Designs of LU Decomposition and Its Algebraic Representation (Short Note).
Comput. J., 1992

1990
A systolic design for generating combinations in lexicographic order.
Parallel Comput., 1990

Systolic Flow.
J. Parallel Distributed Comput., 1990

1989
Generating function and equivalent transformation for systolic arrays.
Parallel Comput., 1989

Equivalent Transformations on Systolic Design Represented by Generating Functions.
J. Inf. Sci. Eng., 1989

A Systolic Generation of Combinations.
BIT, 1989

1988
A Systolic Design to Generate Combinations.
J. Inf. Sci. Eng., 1988

1981
Design and Implementation of a Chinese Terminal Controller.
Comput. Lang., 1981


  Loading...