Jay Belanger

Publication Activity (10 Years)

Years Active: 1992-2002
Publications (10 Years): 0

Publications

Camille Alain Rabbath, M. Abdoune, Jay Belanger, K. Butts
Simulating hybrid dynamic systems. IEEE Robotics Autom. Mag. 9 (2) (2002)
Jay Belanger, Marcus Hausdorf, Werner M. Seiler
A MuPAD Library for Differential Equations. CASC (2001)
Camille Alain Rabbath, M. Abdoune, Jay Belanger
Real-time simulations: effective real-time simulations of event-based systems. WSC (2000)
Jay Belanger, Aduri Pavan, Jie Wang
Reductions Do Not Preserve Fast Convergence Rates in Average Time. Algorithmica 23 (4) (1999)
Jay Belanger, Jie Wang
No NP Problems Averaging Over Ranking of Distributions are Harder. Theor. Comput. Sci. 181 (2) (1997)
Jay Belanger, Jie Wang
Reductions and Convergence Rates of Average Time. COCOON (1996)
Jay Belanger, Jie Wang
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. COCOON (1995)
Jie Wang, Jay Belanger
On the NP-Isomorphism Problem with Respect to Random Instances. J. Comput. Syst. Sci. 50 (1) (1995)
Jay Belanger, Jie Wang
Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions Electron. Colloquium Comput. Complex. 2 (18) (1995)
Jie Wang, Jay Belanger
Honest Iteration Schemes of Randomizing Algorithms. Inf. Process. Lett. 45 (6) (1993)
Jay Belanger, Jie Wang
Isomorphisms of NP Complete Problems on Random Instances. Computational Complexity Conference (1993)
Jay Belanger, Jie Wang
On Average P vs. Average NP. Complexity Theory: Current Research (1992)
Jie Wang, Jay Belanger
On Average P vs. Average NP. Computational Complexity Conference (1992)
Jie Wang, Jay Belanger
Honest Iteration Schemes of Randomizing Algorithms. ISAAC (1992)