Chau-Jy Lin

Publications36
h-index7
Citations123
Highly Influential Citations3
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • C. Wu
  • 74 Publications • 232 Citations
  • J. Tsai
  • 38 Publications • 1 Citation
  • H. Spector
  • 91 Publications • 1,345 Citations
  • S. Akl
  • 426 Publications • 7,305 Citations
  • Publications
  • Influence
Parallel generation of permutations on systolic arrays
  • Chau-Jy Lin
  • Computer Science
  • Parallel Comput.
  • 1 September 1990
TLDR
We present a systolic algorithm to generate all the n! permutations of n given items. This algorithm requires n time steps to solve this problem. Expand
  • 11
  • 1
Parallel Algorithm for Generating Permutations on Linear Array
  • Chau-Jy Lin
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1 August 1990
TLDR
Given n items, a parallel algorithm for generating the n! permutations is presented. Each PE is responsible for producing one component of each permutation. Expand
  • 8
  • 1
  • PDF
A systolic algorithm for solving knapsack problems
TLDR
A systolic algorithm for solving the 0/1-knapsack problems with n items is presented. Expand
  • 1
  • 1
A systolic generation of combinations
TLDR
A parallel algorithm for generating all combinations ofm (m fixed) items out of anyn given items in lexicographic order is presented. Expand
  • 11
  • PDF
A systolic design for generating combinations in lexicographic order
TLDR
A linear systolic array for generating all combinations of m items (m is given) out of n given items in lexicographic order is presented. Expand
  • 5
Generating subsets on a systolic array
Abstract Given n elements and an arbitrary integer m for m ⩽ n, a systolic algorithm for generating all r -subsets (subsets containing r elements) with 1 ⩽ r ⩽ m in lexicographic order is presented.… Expand
  • 2
Parallel permutation generation on linear array
  • Chau-Jy Lin
  • Mathematics, Computer Science
  • Int. J. Comput. Math.
  • 1991
TLDR
Given n items, a parallel algorithm for generating all the n! permutations is presented. The design procedures of this algorithm are considered in detail. Expand
  • 6
Free-carrier absorption in n-type piezoelectric semiconductor films
Free-carrier absorption in n-type GaAs films has been investigated for the case where the free carriers are confined in a quasi-two-dimensional semiconducting structure with a non-parabolic energy… Expand
  • 9
  • PDF
Impurity-limited mobility of semiconducting thin wires in n-type gallium arsenide
The impurity-limited mobility of semiconducting thin wires for the nonparabolic band structure of electrons in n-type gallium arsenide has been investigated by scattering from ionized impurities or… Expand
  • 7
Free-carrier absorption in heavily doped quasi-two-dimensional semiconducting structures
  • 2
...
1
2
3
4
...