Shouwen Tang

15 papers A* 2B 1Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
1996 J jnl
Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics.
Algorithmica
Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
1995 J jnl
Spectral and spatial decorrelation of Landsat-TM data for lossless compression.
IEEE Trans. Geosci. Remote. Sens.
JinFei Wang, Kaizhong Zhang, Shouwen Tang
1994 B conf
Matching with Matrix Norm Minimization.
CPM
Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
1993 J jnl
Exponential-Time and Subexponential-Time Sets.
Theor. Comput. Sci.
Shouwen Tang, Bin Fu, Tian Liu
1992 J jnl
On Polynomial-Time Turing and Many-One Completeness in PSPACE.
Theor. Comput. Sci.
Osamu Watanabe, Shouwen Tang
1991 — conf
Exponential Time and Subexponential Time Sets.
SCT
Shouwen Tang, Bin Fu, Tian Liu
1991 J jnl
Polynomial-Time Reducibilities and "Almost All" Oracle Sets.
Theor. Comput. Sci.
Shouwen Tang, Ronald V. Book
1991 J jnl
Reducibilities on tally and sparse sets.
RAIRO Theor. Informatics Appl.
Shouwen Tang, Ronald V. Book
1990 A* conf
Additional Queries to Random and Pseudorandom Oracles.
ICALP
Ronald V. Book, Jack H. Lutz, Shouwen Tang
1990 J jnl
Characterizing Polynomial Complexity Classes by Reducibilities.
Math. Syst. Theory
Ronald V. Book, Shouwen Tang
1989 J jnl
A Note on Sparse Sets and the Polynomial-Time Hierarchy.
Inf. Process. Lett.
Ronald V. Book, Shouwen Tang
1989 — conf
On Polynomial Time Turing and Many-One Completeness in PSPACE.
SCT
Osamu Watanabe, Shouwen Tang
1989 J jnl
On Tally Relativizations of BP-Complexity Classes.
SIAM J. Comput.
Shouwen Tang, Osamu Watanabe
1988 — conf
On tally relativizations of BP-complexity classes.
SCT
Shouwen Tang, Osamu Watanabe
1988 A* conf
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets.
ICALP
Shouwen Tang, Ronald V. Book