PNP[log n] and sparse turing complete sets for NP. - Jim Kadin (SCT, 1987)

The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. - Jim Kadin (SIAM J. Comput., 1988)

Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy. - Jim Kadin (1988)

P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. - Jim Kadin (J. Comput. Syst. Sci., 1989)

Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. - Richard Chang 001; Jim Kadin; Pankaj Rohatgi (SCT, 1991)

Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. - Jim Kadin (SIAM J. Comput., 1991)

Some Observations about Relativization of Space Bounded Computations. - Juris Hartmanis; Richard Chang 001; Jim Kadin; Stephen G. Mitchell (Current Trends in Theoretical Computer Science, 1993)

On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. - Richard Chang 001; Jim Kadin; Pankaj Rohatgi (J. Comput. Syst. Sci., 1995)

On Computing Boolean Connectives of Characteristic Functions. - Richard Chang 001; Jim Kadin (Math. Syst. Theory, 1995)

The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. - Richard Chang 001; Jim Kadin (SIAM J. Comput., 1996)

Functions Computable with Nonadaptive Queries to NP. - Harry Buhrman; Jim Kadin; Thomas Thierauf (Theory Comput. Syst., 1998)