Richard Chang

38 papers A* 1A 4Journal 19Unranked 8
YearRankTypeTitle / Venue / Authors
2020 — conf
Formal Methods Analysis of the Secure Remote Password Protocol.
Logic, Language, and Security
Alan T. Sherman, Erin Lanus, Moses Liskov, Edward Zieglar, Richard Chang, Enis Golaszewski, Ryan Wnuk-Fink, Cyrus J. Bonyadi, Mario Yaksetig, Ian Blumenfeld
2020 J jnl
Formal Methods Analysis of the Secure Remote Password Protocol.
CoRR
Alan T. Sherman, Erin Lanus, Moses Liskov, Edward Zieglar, Richard Chang, Enis Golaszewski, Ryan Wnuk-Fink, Cyrus J. Bonyadi, Mario Yaksetig, Ian Blumenfeld
2008 A conf
Amplifying ZPP^SAT[1] and the Two Queries Problem.
CCC
Richard Chang, Suresh Purini
2007 A conf
Bounded Queries and the NP Machine Hypothesis.
CCC
Richard Chang, Suresh Purini
2003 A conf
One Bit of Advice.
STACS
Harry Buhrman, Richard Chang, Lance Fortnow
2001 — ch.
A Machine Model for the Complexity of NP-Approximation Problems.
Current Trends in Theoretical Computer Science
Richard Chang
2001 J jnl
Bounded Queries, Approximations, and the Boolean Hierarchy.
Inf. Comput.
Richard Chang
2001 A conf
Bounded Query Functions with Limited Output Bits.
CCC
Richard Chang, Jon S. Squire
2001 J jnl
Commutative Queries.
Inf. Comput.
Richard Beigel, Richard Chang
1999 J jnl
On Finding the Number of Graph Automorphisms.
Chic. J. Theor. Comput. Sci.
Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
1997 J jnl
Bounded Queries, Approximations and the Boolean Hierarchy
Electron. Colloquium Comput. Complex.
Richard Chang
1997 — conf
Commutative Queries.
ISTCS
Richard Beigel, Richard Chang
1997 J jnl
On Bounded Queries and Approximation.
SIAM J. Comput.
Richard Chang, William I. Gasarch, Carsten Lund
1996 J jnl
On the Query Complexity of Clique Size and Maximum Satisfiability.
J. Comput. Syst. Sci.
Richard Chang
1996 J jnl
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection.
SIAM J. Comput.
Richard Chang, Jim Kadin
1995 J jnl
On Computing Boolean Connectives of Characteristic Functions.
Math. Syst. Theory
Richard Chang, Jim Kadin
1995 — conf
On Finding the Number of Graph Automorphisms.
SCT
Richard Chang, William I. Gasarch, Jacobo Torán
1995 J jnl
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
J. Comput. Syst. Sci.
Richard Chang, Jim Kadin, Pankaj Rohatgi
1994 J jnl
A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy.
Bull. EATCS
Richard Chang
1994 — conf
On the Query Complexity of Clique Size and Maximum Satisfiability.
SCT
Richard Chang
1994 J jnl
The Random Oracle Hypothesis Is False.
J. Comput. Syst. Sci.
Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
1993 J jnl
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies.
Math. Syst. Theory
Richard Beigel, Richard Chang, Mitsunori Ogiwara
1993 A* conf
On Bounded Queries and Approximation
FOCS
Richard Chang, William I. Gasarch
1993 — ch.
On IP = PSPACE and Theorems with Narrow Proofs.
Current Trends in Theoretical Computer Science
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
1993 — ch.
On Unique Satisfiability and Randomized Reductions.
Current Trends in Theoretical Computer Science
Richard Chang, Pankaj Rohatgi
1993 — ch.
Relativization: a Revisionistic Retrospective.
Current Trends in Theoretical Computer Science
Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi
1993 — ch.
Some Observations about Relativization of Space Bounded Computations.
Current Trends in Theoretical Computer Science
Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell
1992 J jnl
On the Structure of Bounded Queries to Arbitrary NP Sets.
SIAM J. Comput.
Richard Chang
1992 J jnl
Relativization: a revisionistic retrospective.
Bull. EATCS
Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi
1991 — conf
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
SCT
Richard Chang, Jim Kadin, Pankaj Rohatgi
1991 — —
On the Structure of NP Computations under Boolean Operators.
Richard Chang
1991 J jnl
Space Bounded Computations: Review and New Separation Results.
Theor. Comput. Sci.
Desh Ranjan, Richard Chang, Juris Hartmanis
1990 J jnl
An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof.
Bull. EATCS
Richard Chang
1990 J jnl
On Unique Staisfiability and Randomized Reductions.
Bull. EATCS
Richard Chang, Pankaj Rohatgi
1990 J jnl
On Unique Staisfiability and Randomized Reductions.
Bull. EATCS
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
1990 — conf
Structural Complexity Theory: recent Surprises.
SWAT
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
1990 — conf
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection.
SCT
Richard Chang, Jim Kadin
1989 — conf
On the Structure of Bounded Queries to Arbitrary NP Sets.
SCT
Richard Chang