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

Search the dblp DataBase

Title:
Author:
Jim Kadin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jim Kadin
    P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:3, pp:282-298 [Journal]
  2. Harry Buhrman, Jim Kadin, Thomas Thierauf
    On Functions Computable with Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:43-52 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. Harry Buhrman, Jim Kadin, Thomas Thierauf
    Functions Computable with Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:1, pp:77-92 [Journal]
  7. 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]
  8. 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]
  9. Jim Kadin
    The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1263-1282 [Journal]
  10. Jim Kadin
    Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:404- [Journal]

Search in 0.001secs, Finished in 0.002secs
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