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