The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Richard Chang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  31. Amplifying ZPP^SAT[1] and the Two Queries Problem. [Citation Graph (, )][DBLP]


  32. Shapes to synchronize camera networks. [Citation Graph (, )][DBLP]


  33. Using structures to synchronize cameras of robots swarms. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002