| 2008 |
|---|
| 34 | EE | Richard Chang,
Sio-Hoi Ieng,
Ryad Benosman:
Shapes to synchronize camera networks.
ICPR 2008: 1-4 |
| 33 | EE | Richard Chang,
Suresh Purini:
Amplifying ZPP^SAT[1] and the Two Queries Problem.
IEEE Conference on Computational Complexity 2008: 41-52 |
| 32 | EE | Richard Chang,
Sio-Hoi Ieng,
Ryad Benosman:
Using structures to synchronize cameras of robots swarms.
IROS 2008: 3266-3271 |
| 2007 |
|---|
| 31 | EE | Richard Chang,
Suresh Purini:
Bounded Queries and the NP Machine Hypothesis.
IEEE Conference on Computational Complexity 2007: 52-59 |
| 2003 |
|---|
| 30 | EE | S. Simon Wong,
C. Patrick Yue,
Richard Chang,
So-Young Kim,
Bendik Kleveland,
Frank O'Mahony:
On-Chip Interconnect Inductance - Friend or Foe (Invited).
ISQED 2003: 389-394 |
| 29 | EE | Harry Buhrman,
Richard Chang,
Lance Fortnow:
One Bit of Advice.
STACS 2003: 547-558 |
| 2001 |
|---|
| 28 | EE | Richard Chang,
Jon S. Squire:
Bounded Query Functions with Limited Output Bits.
IEEE Conference on Computational Complexity 2001: 90-98 |
| 27 | | Richard Chang:
A Machine Model for the Complexity of NP-Approximation Problems.
Current Trends in Theoretical Computer Science 2001: 4-24 |
| 26 | | Richard Beigel,
Richard Chang:
Commutative Queries.
Inf. Comput. 166(1): 71-91 (2001) |
| 25 | | Richard Chang:
Bounded Queries, Approximations, and the Boolean Hierarchy.
Inf. Comput. 169(2): 129-159 (2001) |
| 1999 |
|---|
| 24 | EE | Robert Beals,
Richard Chang,
William I. Gasarch,
Jacobo Torán:
On Finding the Number of Graph Automorphisms.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
| 1997 |
|---|
| 23 | EE | Richard Beigel,
Richard Chang:
Commutative Queries.
ISTCS 1997: 159-165 |
| 22 | EE | Richard Chang:
Bounded Queries, Approximations and the Boolean Hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 4(35): (1997) |
| 21 | | Richard Chang,
William I. Gasarch,
Carsten Lund:
On Bounded Queries and Approximation.
SIAM J. Comput. 26(1): 188-209 (1997) |
| 1996 |
|---|
| 20 | | Richard Chang:
On the Query Complexity of Clique Size and Maximum Satisfiability.
J. Comput. Syst. Sci. 53(2): 298-313 (1996) |
| 19 | | Richard Chang,
Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection.
SIAM J. Comput. 25(2): 340-354 (1996) |
| 1995 |
|---|
| 18 | | Richard Chang,
William I. Gasarch,
Jacobo Torán:
On Finding the Number of Graph Automorphisms.
Structure in Complexity Theory Conference 1995: 288-298 |
| 17 | | 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) |
| 16 | | Richard Chang,
Jim Kadin:
On Computing Boolean Connectives of Characteristic Functions.
Mathematical Systems Theory 28(3): 173-198 (1995) |
| 1994 |
|---|
| 15 | | Richard Chang:
On the Query Complexity of Clique Size and Maximum Satisfiability.
Structure in Complexity Theory Conference 1994: 31-42 |
| 14 | | Richard Chang:
A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy.
Bulletin of the EATCS 54: 166-183 (1994) |
| 13 | | 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) |
| 1993 |
|---|
| 12 | | Richard Chang,
William I. Gasarch:
On Bounded Queries and Approximation
FOCS 1993: 547-556 |
| 11 | | Richard Beigel,
Richard Chang,
Mitsunori Ogiwara:
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies.
Mathematical Systems Theory 26(3): 293-310 (1993) |
| 1992 |
|---|
| 10 | | Richard Chang,
Suresh Chari,
Desh Ranjan,
Pankaj Rohatgi:
Relativization: a revisionistic retrospective.
Bulletin of the EATCS 47: 144-153 (1992) |
| 9 | | Richard Chang:
On the Structure of Bounded Queries to Arbitrary NP Sets.
SIAM J. Comput. 21(4): 743-754 (1992) |
| 1991 |
|---|
| 8 | | Richard Chang,
Jim Kadin,
Pankaj Rohatgi:
Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions.
Structure in Complexity Theory Conference 1991: 255-269 |
| 7 | | Desh Ranjan,
Richard Chang,
Juris Hartmanis:
Space Bounded Computations: Review and New Separation Results.
Theor. Comput. Sci. 80(2): 289-302 (1991) |
| 1990 |
|---|
| 6 | | Juris Hartmanis,
Richard Chang,
Desh Ranjan,
Pankaj Rohatgi:
Structural Complexity Theory: recent Surprises.
SWAT 1990: 1-12 |
| 5 | | Richard Chang,
Jim Kadin:
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection.
Structure in Complexity Theory Conference 1990: 169-178 |
| 4 | | Juris Hartmanis,
Richard Chang,
Desh Ranjan,
Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions.
Bulletin of the EATCS 41: 166-174 (1990) |
| 3 | | Richard Chang,
Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions.
Bulletin of the EATCS 42: 151-159 (1990) |
| 2 | | Richard Chang:
An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof.
Bulletin of the EATCS 42: 172-173 (1990) |
| 1989 |
|---|
| 1 | | Richard Chang:
On the Structure of Bounded Queries to Arbitrary NP Sets.
Structure in Complexity Theory Conference 1989: 250-258 |
