Richard Chang

Publication Activity (10 Years)

Years Active: 1989-2020
Publications (10 Years): 2

Top Topics

User Authentication

Top Venues

Logic, Language, and Security

Publications

Alan T. Sherman, Erin Lanus, Moses Liskov, Edward Zieglar, Richard Chang, Enis Golaszewski, Ryan Wnuk-Fink, Cyrus J. Bonyadi, Mario Yaksetig, Ian Blumenfeld
Formal Methods Analysis of the Secure Remote Password Protocol. Logic, Language, and Security (2020)
Alan T. Sherman, Erin Lanus, Moses Liskov, Edward Zieglar, Richard Chang, Enis Golaszewski, Ryan Wnuk-Fink, Cyrus J. Bonyadi, Mario Yaksetig, Ian Blumenfeld
Formal Methods Analysis of the Secure Remote Password Protocol. CoRR (2020)
Richard Chang, Suresh Purini
Amplifying ZPP^SAT[1] and the Two Queries Problem. Computational Complexity Conference (2008)
Richard Chang, Suresh Purini
Bounded Queries and the NP Machine Hypothesis. Computational Complexity Conference (2007)
Harry Buhrman, Richard Chang, Lance Fortnow
One Bit of Advice. STACS (2003)
Richard Chang
Bounded Queries, Approximations, and the Boolean Hierarchy. Inf. Comput. 169 (2) (2001)
Richard Beigel, Richard Chang
Commutative Queries. Inf. Comput. 166 (1) (2001)
Richard Chang, Jon S. Squire
Bounded Query Functions with Limited Output Bits. Computational Complexity Conference (2001)
Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
On Finding the Number of Graph Automorphisms. Chic. J. Theor. Comput. Sci. 1999 (1999)
Richard Beigel, Richard Chang
Commutative Queries. ISTCS (1997)
Richard Chang
Bounded Queries, Approximations and the Boolean Hierarchy Electron. Colloquium Comput. Complex. 4 (35) (1997)
Richard Chang, William I. Gasarch, Carsten Lund
On Bounded Queries and Approximation. SIAM J. Comput. 26 (1) (1997)
Richard Chang
On the Query Complexity of Clique Size and Maximum Satisfiability. J. Comput. Syst. Sci. 53 (2) (1996)
Richard Chang, Jim Kadin
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. SIAM J. Comput. 25 (2) (1996)
Richard Chang, William I. Gasarch, Jacobo Torán
On Finding the Number of Graph Automorphisms. Computational Complexity Conference (1995)
Richard Chang, Jim Kadin, Pankaj Rohatgi
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. J. Comput. Syst. Sci. 50 (3) (1995)
Richard Chang, Jim Kadin
On Computing Boolean Connectives of Characteristic Functions. Math. Syst. Theory 28 (3) (1995)
Richard Chang
A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy. Bull. EATCS 54 (1994)
Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
The Random Oracle Hypothesis Is False. J. Comput. Syst. Sci. 49 (1) (1994)
Richard Chang
On the Query Complexity of Clique Size and Maximum Satisfiability. Computational Complexity Conference (1994)
Richard Chang, William I. Gasarch
On Bounded Queries and Approximation FOCS (1993)
Richard Beigel, Richard Chang, Mitsunori Ogiwara
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. Math. Syst. Theory 26 (3) (1993)
Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi
Relativization: a revisionistic retrospective. Bull. EATCS 47 (1992)
Richard Chang
On the Structure of Bounded Queries to Arbitrary NP Sets. SIAM J. Comput. 21 (4) (1992)
Desh Ranjan, Richard Chang, Juris Hartmanis
Space Bounded Computations: Review and New Separation Results. Theor. Comput. Sci. 80 (2) (1991)
Richard Chang, Jim Kadin, Pankaj Rohatgi
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. Computational Complexity Conference (1991)
Richard Chang
An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof. Bull. EATCS 42 (1990)
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
Structural Complexity Theory: recent Surprises. SWAT (1990)
Richard Chang, Jim Kadin
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. Computational Complexity Conference (1990)
Richard Chang, Pankaj Rohatgi
On Unique Staisfiability and Randomized Reductions. Bull. EATCS 42 (1990)
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
On Unique Staisfiability and Randomized Reductions. Bull. EATCS 41 (1990)
Richard Chang
On the Structure of Bounded Queries to Arbitrary NP Sets. Computational Complexity Conference (1989)