Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. - Shouwen Tang; Ronald V. Book (ICALP, 1988)

A Note on Sparse Sets and the Polynomial-Time Hierarchy. - Ronald V. Book; Shouwen Tang (Inf. Process. Lett., 1989)

On Tally Relativizations of BP-Complexity Classes. - Shouwen Tang; Osamu Watanabe 001 (SIAM J. Comput., 1989)

Additional Queries to Random and Pseudorandom Oracles. - Ronald V. Book; Jack H. Lutz; Shouwen Tang (ICALP, 1990)

Characterizing Polynomial Complexity Classes by Reducibilities. - Ronald V. Book; Shouwen Tang (Math. Syst. Theory, 1990)

Reducibilities on tally and sparse sets. - Shouwen Tang; Ronald V. Book (RAIRO Theor. Informatics Appl., 1991)

Polynomial-Time Reducibilities and "Almost All" Oracle Sets. - Shouwen Tang; Ronald V. Book (Theor. Comput. Sci., 1991)

On Polynomial-Time Turing and Many-One Completeness in PSPACE. - Osamu Watanabe 001; Shouwen Tang (Theor. Comput. Sci., 1992)

Exponential-Time and Subexponential-Time Sets. - Shouwen Tang; Bin Fu; Tian Liu (Theor. Comput. Sci., 1993)

Matching with Matrix Norm Minimization. - Shouwen Tang; Kaizhong Zhang; Xiaolin Wu 001 (CPM, 1994)

Spectral and spatial decorrelation of Landsat-TM data for lossless compression. - Jinfei Wang; Kaizhong Zhang; Shouwen Tang (IEEE Trans. Geosci. Remote. Sens., 1995)

Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics. - Shouwen Tang; Kaizhong Zhang; Xiaolin Wu 001 (Algorithmica, 1996)