Structural Complexity Theory: recent Surprises. - Juris Hartmanis; Richard Chang 001; Desh Ranjan; Pankaj Rohatgi (SWAT, 1990)

An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof. - Richard Chang 001 (Bull. EATCS, 1990)

On Unique Staisfiability and Randomized Reductions. - Richard Chang 001; Pankaj Rohatgi (Bull. EATCS, 1990)

On Unique Staisfiability and Randomized Reductions. - Juris Hartmanis; Richard Chang 001; Desh Ranjan; Pankaj Rohatgi (Bull. EATCS, 1990)

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

Space Bounded Computations: Review and New Separation Results. - Desh Ranjan; Richard Chang 001; Juris Hartmanis (Theor. Comput. Sci., 1991)

On the Structure of NP Computations under Boolean Operators. - Richard Chang 001 (1991)

Relativization: a revisionistic retrospective. - Richard Chang 001; Suresh Chari; Desh Ranjan; Pankaj Rohatgi (Bull. EATCS, 1992)

On the Structure of Bounded Queries to Arbitrary NP Sets. - Richard Chang 001 (SIAM J. Comput., 1992)

On Bounded Queries and Approximation - Richard Chang 001; William I. Gasarch (FOCS, 1993)

A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. - Richard Beigel; Richard Chang 001; Mitsunori Ogiwara (Math. Syst. Theory, 1993)

On Unique Satisfiability and Randomized Reductions. - Richard Chang 001; Pankaj Rohatgi (Current Trends in Theoretical Computer Science, 1993)

Relativization: a Revisionistic Retrospective. - Juris Hartmanis; Richard Chang 001; Suresh Chari; Desh Ranjan; Pankaj Rohatgi (Current Trends in Theoretical Computer Science, 1993)

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 IP = PSPACE and Theorems with Narrow Proofs. - Juris Hartmanis; Richard Chang 001; Desh Ranjan; Pankaj Rohatgi (Current Trends in Theoretical Computer Science, 1993)

A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy. - Richard Chang 001 (Bull. EATCS, 1994)

The Random Oracle Hypothesis Is False. - Richard Chang 001; Benny Chor; Oded Goldreich 001; Juris Hartmanis; Johan Håstad; Desh Ranjan; Pankaj Rohatgi (J. Comput. Syst. Sci., 1994)

On Finding the Number of Graph Automorphisms. - Richard Chang 001; William I. Gasarch; Jacobo Torán (SCT, 1995)

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)

On the Query Complexity of Clique Size and Maximum Satisfiability. - Richard Chang 001 (J. Comput. Syst. Sci., 1996)

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

Bounded Queries, Approximations and the Boolean Hierarchy - Richard Chang 001 (Electron. Colloquium Comput. Complex., 1997)

On Bounded Queries and Approximation. - Richard Chang 001; William I. Gasarch; Carsten Lund (SIAM J. Comput., 1997)

On Finding the Number of Graph Automorphisms. - Robert Beals; Richard Chang 001; William I. Gasarch; Jacobo Torán (Chic. J. Theor. Comput. Sci., 1999)

A Machine Model for the Complexity of NP-Approximation Problems. - Richard Chang 001 (Current Trends in Theoretical Computer Science, 2001)

Bounded Query Functions with Limited Output Bits. - Richard Chang 001; Jon S. Squire (CCC, 2001)

Commutative Queries. - Richard Beigel; Richard Chang 001 (Inf. Comput., 2001)

One Bit of Advice. - Harry Buhrman; Richard Chang 001; Lance Fortnow (STACS, 2003)

Bounded Queries and the NP Machine Hypothesis. - Richard Chang 001; Suresh Purini (CCC, 2007)

Amplifying ZPP^SAT[1] and the Two Queries Problem. - Richard Chang 001; Suresh Purini (CCC, 2008)

Formal Methods Analysis of the Secure Remote Password Protocol. - Alan T. Sherman; Erin Lanus; Moses Liskov; Edward Zieglar; Richard Chang 001; Enis Golaszewski; Ryan Wnuk-Fink; Cyrus J. Bonyadi; Mario Yaksetig; Ian Blumenfeld (Logic, Language, and Security, 2020)