default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Chang 0001
Person information
- affiliation: University of Maryland Baltimore County, Baltimore, MD, USA
- affiliation (PhD 1991): Cornell University, Ithaca, NY, USA
Other persons with the same name
- Richard Chang — disambiguation page
- Richard Chang 0002
![[0000-0003-1748-8498]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-1748-8498")
— Institute for Infocomm Research, Singapore (and 1 more) - Richard Chang 0003 — Atheros Communications, Inc., San Jose, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c13]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: 103-126- [i2]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 abs/2003.07421 (2020)
2000 – 2009
- 2008
- [c12]Richard Chang, Suresh Purini:
Amplifying ZPP^SAT[1] and the Two Queries Problem. CCC 2008: 41-52 - 2007
- [c11]Richard Chang, Suresh Purini:
Bounded Queries and the NP Machine Hypothesis. CCC 2007: 52-59 - 2003
- [c10]Harry Buhrman, Richard Chang, Lance Fortnow:
One Bit of Advice. STACS 2003: 547-558 - 2001
- [j17]Richard Beigel, Richard Chang:
Commutative Queries. Inf. Comput. 166(1): 71-91 (2001) - [j16]Richard Chang:
Bounded Queries, Approximations, and the Boolean Hierarchy. Inf. Comput. 169(2): 129-159 (2001) - [c9]Richard Chang, Jon S. Squire:
Bounded Query Functions with Limited Output Bits. CCC 2001: 90-98 - [p5]Richard Chang:
A Machine Model for the Complexity of NP-Approximation Problems. Current Trends in Theoretical Computer Science 2001: 4-24
1990 – 1999
- 1999
- [j15]Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán:
On Finding the Number of Graph Automorphisms. Chic. J. Theor. Comput. Sci. 1999 (1999) - 1997
- [j14]Richard Chang, William I. Gasarch, Carsten Lund:
On Bounded Queries and Approximation. SIAM J. Comput. 26(1): 188-209 (1997) - [c8]Richard Beigel, Richard Chang:
Commutative Queries. ISTCS 1997: 159-165 - [i1]Richard Chang:
Bounded Queries, Approximations and the Boolean Hierarchy. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j13]Richard Chang:
On the Query Complexity of Clique Size and Maximum Satisfiability. J. Comput. Syst. Sci. 53(2): 298-313 (1996) - [j12]Richard Chang, Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. SIAM J. Comput. 25(2): 340-354 (1996) - 1995
- [j11]Richard Chang, Jim Kadin, Pankaj Rohatgi:
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions. J. Comput. Syst. Sci. 50(3): 359-373 (1995) - [j10]Richard Chang, Jim Kadin:
On Computing Boolean Connectives of Characteristic Functions. Math. Syst. Theory 28(3): 173-198 (1995) - [c7]Richard Chang, William I. Gasarch, Jacobo Torán:
On Finding the Number of Graph Automorphisms. SCT 1995: 288-298 - 1994
- [j9]Richard Chang:
A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy. Bull. EATCS 54: 166-183 (1994) - [j8]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): 24-39 (1994) - [c6]Richard Chang:
On the Query Complexity of Clique Size and Maximum Satisfiability. SCT 1994: 31-42 - 1993
- [j7]Richard Beigel, Richard Chang, Mitsunori Ogiwara:
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies. Math. Syst. Theory 26(3): 293-310 (1993) - [c5]Richard Chang, William I. Gasarch:
On Bounded Queries and Approximation. FOCS 1993: 547-556 - [p4]Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell:
Some Observations about Relativization of Space Bounded Computations. Current Trends in Theoretical Computer Science 1993: 423-434 - [p3]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
On IP = PSPACE and Theorems with Narrow Proofs. Current Trends in Theoretical Computer Science 1993: 484-493 - [p2]Richard Chang, Pankaj Rohatgi:
On Unique Satisfiability and Randomized Reductions. Current Trends in Theoretical Computer Science 1993: 494-503 - [p1]Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi:
Relativization: a Revisionistic Retrospective. Current Trends in Theoretical Computer Science 1993: 537-548 - 1992
- [j6]Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi:
Relativization: a revisionistic retrospective. Bull. EATCS 47: 144-153 (1992) - [j5]Richard Chang:
On the Structure of Bounded Queries to Arbitrary NP Sets. SIAM J. Comput. 21(4): 743-754 (1992) - 1991
- [b1]Richard Chang:
On the Structure of NP Computations under Boolean Operators. Cornell University, USA, 1991 - [j4]Desh Ranjan, Richard Chang, Juris Hartmanis:
Space Bounded Computations: Review and New Separation Results. Theor. Comput. Sci. 80(2): 289-302 (1991) - [c4]Richard Chang, Jim Kadin, Pankaj Rohatgi:
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. SCT 1991: 255-269 - 1990
- [j3]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions. Bull. EATCS 41: 166-174 (1990) - [j2]Richard Chang, Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions. Bull. EATCS 42: 151-159 (1990) - [j1]Richard Chang:
An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof. Bull. EATCS 42: 172-173 (1990) - [c3]Richard Chang, Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. SCT 1990: 169-178 - [c2]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
Structural Complexity Theory: recent Surprises. SWAT 1990: 1-12
1980 – 1989
- 1989
- [c1]Richard Chang:
On the Structure of Bounded Queries to Arbitrary NP Sets. SCT 1989: 250-258
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
