Search the dblp DataBase

Publications of Author

1. Jay Belanger, Jie Wang
   Isomorphisms of NP Complete Problems on Random Instances. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1993, pp:65-74 [Conf]
   
2. Jie Wang, Jay Belanger
   On Average P vs. Average NP. [Citation Graph (0, 0)][DBLP]
   Structure in Complexity Theory Conference, 1992, pp:318-326 [Conf]
   
3. Jay Belanger, Jie Wang
   Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. [Citation Graph (0, 0)][DBLP]
   COCOON, 1995, pp:410-419 [Conf]
   
4. Jay Belanger, Jie Wang
   Reductions and Convergence Rates of Average Time. [Citation Graph (0, 0)][DBLP]
   COCOON, 1996, pp:300-309 [Conf]
   
5. Jay Belanger, Jie Wang
   On Average P vs. Average NP. [Citation Graph (0, 0)][DBLP]
   Complexity Theory: Current Research, 1992, pp:47-67 [Conf]
   
6. Jie Wang, Jay Belanger
   Honest Iteration Schemes of Randomizing Algorithms. [Citation Graph (0, 0)][DBLP]
   ISAAC, 1992, pp:259-268 [Conf]
   
7. C. A. Rabbath, M. Abdoune, Jay Belanger
   Real-time simulations: effective real-time simulations of event-based systems. [Citation Graph (0, 0)][DBLP]
   Winter Simulation Conference, 2000, pp:232-238 [Conf]
   
8. Jay Belanger, Aduri Pavan, Jie Wang
   Reductions Do Not Preserve Fast Convergence Rates in Average Time. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1999, v:23, n:4, pp:363-373 [Journal]
   
9. Jie Wang, Jay Belanger
   Honest Iteration Schemes of Randomizing Algorithms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1993, v:45, n:6, pp:275-278 [Journal]
   
10. Jie Wang, Jay Belanger
    On the NP-Isomorphism Problem with Respect to Random Instances. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:151-164 [Journal]
    
11. Jay Belanger, Jie Wang
    No NP Problems Averaging Over Ranking of Distributions are Harder. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:229-245 [Journal]