Pen-Yuang Chang Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1998
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPen-Yuang Chang, Jong-Chuang Tsay: An Approach to Designing Modular Extensible Linear Arrays for Regular Algorithms. IEEE Trans. Computers 47(2): 212-216 (1998)
1996
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJong-Chuang Tsay, Pen-Yuang Chang: Designing Lower-Dimensional Regular Arrays for Algorithms with Uniform Dependencies. J. Parallel Distrib. Comput. 33(1): 24-32 (1996)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPen-Yuang Chang, Jong-Chuang Tsay: Timespace Mapping for Regular Arrays. Parallel Algorithms Appl. 10(1-2): 37-48 (1996)
1995
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJong-Chuang Tsay, Pen-Yuang Chang: Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules. IEEE Trans. Computers 44(5): 683-694 (1995)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJong-Chuang Tsay, Pen-Yuang Chang: Design of Efficient Regular Arrays for Matrix Multiplication by Two-Step Regularization. IEEE Trans. Parallel Distrib. Syst. 6(2): 215-222 (1995)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJong-Chuang Tsay, Pen-Yuang Chang: Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure. IEEE Trans. Parallel Distrib. Syst. 6(4): 351-362 (1995)
1994
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPen-Yuang Chang, Jong-Chuang Tsay: A Family of Efficient Regular Arrays for Algebraic Path Problem. IEEE Trans. Computers 43(7): 769-777 (1994)

Coauthor Index

1Jong-Chuang Tsay [1] [2] [3] [4] [5] [6] [7]

Copyright © Wed Dec 9 16:00:12 2009 by Michael Ley (ley@uni-trier.de)