On Average P vs. Average NP. - Jie Wang 002; Jay Belanger (SCT, 1992)

Isomorphisms of NP Complete Problems on Random Instances. - Jay Belanger; Jie Wang 002 (SCT, 1993)

Honest Iteration Schemes of Randomizing Algorithms. - Jie Wang 002; Jay Belanger (Inf. Process. Lett., 1993)

Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions - Jay Belanger; Jie Wang 002 (Electron. Colloquium Comput. Complex., 1995)

On the NP-Isomorphism Problem with Respect to Random Instances. - Jie Wang 002; Jay Belanger (J. Comput. Syst. Sci., 1995)

Reductions and Convergence Rates of Average Time. - Jay Belanger; Jie Wang 002 (COCOON, 1996)

No NP Problems Averaging Over Ranking of Distributions are Harder. - Jay Belanger; Jie Wang 002 (Theor. Comput. Sci., 1997)

Reductions Do Not Preserve Fast Convergence Rates in Average Time. - Jay Belanger; Aduri Pavan; Jie Wang 002 (Algorithmica, 1999)

Real-time simulations: effective real-time simulations of event-based systems. - Camille Alain Rabbath; M. Abdoune; Jay Belanger (WSC, 2000)

A MuPAD Library for Differential Equations. - Jay Belanger; Marcus Hausdorf; Werner M. Seiler (CASC, 2001)

Simulating hybrid dynamic systems. - Camille Alain Rabbath; M. Abdoune; Jay Belanger; Kenneth R. Butts (IEEE Robotics Autom. Mag., 2002)